Register | Log in | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

AbnerCYH's data_structure [36 articles]

Recent papers added to AbnerCYH's library classified by the tag data_structure. You can also see everyone's data_structure.
  • Generalized multidimensional data mapping and query processing
    ACM Trans. Database Syst., Vol. 30, No. 3. (September 2005), pp. 661-697.
    by Rui Zhang, Panos Kalnis, Beng C Ooi, Kian-Lee Tan
    posted to graph geometries data_structure algorithms by AbnerCYH on 2008-06-06 05:27:39 as **
  • Efficient query processing on spatial networks
    (2005), pp. 200-209.
    by Jagan Sankaranarayanan, Houman Alborzi, Hanan Samet
    posted to graph geometries data_structure algorithms by AbnerCYH on 2008-06-06 05:27:25 as **
  • Distance join queries on spatial networks
    (2006), pp. 211-218.
    by Jagan Sankaranarayanan, Houman Alborzi, Hanan Samet
    posted to graph geometries data_structure algorithms by AbnerCYH on 2008-06-06 05:27:06 as **
  • Ranking in Spatial Databases
    (1995), pp. 83-95.
    by Gisli R Hjaltason, Hanan Samet
    posted to geometries data_structure algorithms by AbnerCYH on 2008-06-06 05:26:37 as ** along with 1 person sunandap
  • Nonlinearity Of Davenport-Schinzel Sequences And Of A Generalized Path Compression Scheme
    Foundations of Computer Science, 1984. 25th Annual Symposium on (1984), pp. 313-319.
    by S Hart, M Sharir
    posted to data_structure algorithms by AbnerCYH on 2008-05-24 06:01:49 as **
  • Splay trees, Davenport-Schinzel sequences, and the deque conjecture
    (2008), pp. 1115-1124.
    by Seth Pettie
    posted to data_structure combinatorics by AbnerCYH on 2008-05-24 06:01:42 as **
  • Sorting Jordan sequences in linear time
    (1985), pp. 196-203.
    by Kurt Hoffmann, Kurt Mehlhorn, Pierre Rosenstiehl, Robert E Tarjan
    posted to geometries data_structure combinatorics algorithms by AbnerCYH on 2008-04-28 17:27:15 as **
  • Sorting Jordan sequences in linear time using level-linked search trees
    Inf. Control, Vol. 68, No. 1-3. (1986), pp. 170-184.
    by Kurt Hoffmann, Kurt Mehlhorn, Pierre Rosenstiehl, Robert E Tarjan
    posted to data_structure combinatorics algorithms by AbnerCYH on 2008-04-28 17:23:00 as **
  • Summarization Graph Indexing: Beyond Frequent Structure-Based Approach
    Vol. 4947 (2008)
    by Lei Zou, Lei Chen, Huaming Zhang, Yansheng Lu, Qiang Lou
    posted to algorithms data_structure graph by AbnerCYH on 2008-04-21 15:41:28 as **
  • Algorithm 513: Analysis of In-Situ Transposition [F1]
    ACM Trans. Math. Softw., Vol. 3, No. 1. (March 1977), pp. 104-110.
    by Esko G Cate, David W Twigg
    posted to algorithms data_structure by AbnerCYH on 2008-04-03 20:58:36 as **
  • Efficient parallel out-of-core matrix transposition
    Cluster Computing, 2003. Proceedings. 2003 IEEE International Conference on (2003), pp. 300-307.
    by S Krisnamoorthy, G Baumgartner, D Cociorva, Chi-Chung Lam, P Sadyappan
    posted to algorithms data_structure parallel by AbnerCYH on 2008-04-03 20:36:08 as **
  • An efficient algorithm for out-of-core matrix transposition
    Computers, IEEE Transactions on, Vol. 51, No. 4. (2002), pp. 420-438.
    by Jinwoo Suh, VK Prasanna
    posted to algorithms data_structure by AbnerCYH on 2008-04-03 20:36:01 as **
  • A general transposition method for a matrix on auxiliary store
    BIT Numerical Mathematics, Vol. 30, No. 1. (1 March 1990), pp. 2-16.
    by Nils Andersen
    posted to algorithms data_structure by AbnerCYH on 2008-04-03 18:49:43 as **
  • PRIM: A Fast Matrix Transpose Method
    Software Engineering, IEEE Transactions on, Vol. SE-7, No. 2. (1981), pp. 255-257.
    by GC Goldbogen
    posted to algorithms data_structure by AbnerCYH on 2008-04-03 18:46:41 as **
  • Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
    SIAM Journal on Computing, Vol. 28, No. 1. (1998), pp. 105-136.
    by Thomas H Cormen, Thomas Sundquist, Leonard F Wisniewski
    posted to algorithms complexity data_structure parallel by AbnerCYH on 2008-04-03 04:38:17 as **
  • Representation of an order as union of interval orders
    Vol. 831 (1994)
    by Christian Capelle
    posted to algorithms data_structure order by AbnerCYH on 2008-04-01 02:36:45 as **
  • notes A data structure for manipulating priority queues
    Commun. ACM, Vol. 21, No. 4. (April 1978), pp. 309-315.
    by Jean Vuillemin
    posted to data_structure by AbnerCYH on 2008-03-25 05:21:15 as ** along with 2 people muli damaru
  • On the expected behavior of disjoint set union algorithms
    (1985), pp. 224-231.
    by B Bollobás, I Simon
    posted to algorithms data_structure by AbnerCYH on 2008-03-24 18:24:02 as **
  • Self-adjusting binary search trees
    J. Assoc. Comput. Mach., Vol. 32, No. 3. (1985), pp. 652-686.
    by Daniel D Sleator, Robert E Tarjan
    posted to data_structure by AbnerCYH on 2008-03-18 05:30:45 as ** along with 3 people ejones jburnim calvins
  • Efficiency of a Good But Not Linear Set Union Algorithm
    J. ACM, Vol. 22, No. 2. (April 1975), pp. 215-225.
    by Robert E Tarjan
    posted to algorithms data_structure by AbnerCYH on 2008-03-14 20:10:32 as **
  • The soft heap: an approximate priority queue with optimal error rate
    J. ACM, Vol. 47, No. 6. (November 2000), pp. 1012-1027.
    by Bernard Chazelle
    posted to algorithms data_structure by AbnerCYH on 2008-03-14 20:07:55 as read
  • Bidirectional expansion for keyword search on graph databases
    (2005), pp. 505-516.
    by Varun Kacholia, Shashank Pandit, Soumen Chakrabarti, S Sudarshan, Rushi Desai, Hrishikesh Karambelkar
    posted to algorithms data_structure graph kdd by AbnerCYH on 2008-02-13 12:23:04 as ** along with 1 person vannevarvision
  • Space Efficient Algorithms for Ordered Tree Comparison
    Algorithmica
    by Lusheng Wang, Kaizhong Zhang
    posted to algorithms data_structure graph order by AbnerCYH on 2008-01-21 20:53:45 as ** along with 1 person ima
  • MapReduce: Simplified Data Processing on Large Clusters
    (December 2004)
    by Jeffrey Dean, Sanjay Ghemawat
    posted to algorithms data_structure distributed sys_performance by AbnerCYH on 2008-01-21 20:16:37 as **
  • Fast and practical indexing and querying of very large graphs
    (2007), pp. 845-856.
    by Silke Tri\ssl, Ulf Leser
    posted to algorithms data_structure graph by AbnerCYH on 2008-01-15 06:54:38 as *****
  • Google's MapReduce programming model -- Revisited
    Science of Computer Programming, Vol. 70, No. 1. (1 January 2008), pp. 1-30.
    by Ralf Lammel
    posted to algorithms data_structure by AbnerCYH on 2007-12-20 18:37:43 as ** along with 6 people marcinzalewski pdlug jrw JeffreyPalmer spl angus
  • Model indexing: the graph-hashing approach
    Computer Vision and Pattern Recognition, 1992. Proceedings CVPR '92., 1992 IEEE Computer Society Conference on (1992), pp. 811-814.
    by H Sossa, R Horaud
    posted to algebra algorithms data_structure graph by AbnerCYH on 2007-12-06 16:40:49 as ** along with 1 person bigbossman
  • Indexing hierarchical structures using graph spectra
    Transactions on Pattern Analysis and Machine Intelligence, Vol. 27, No. 7. (2005), pp. 1125-1140.
    by A Shokoufandeh, D Macrini, S Dickinson, K Siddiqi, SW Zucker
    posted to algebra algorithms data_structure graph by AbnerCYH on 2007-12-06 16:40:44 as ** along with 1 person bigbossman
  • Graphgrep: A fast and universal method for querying graphs
    (2002)
    by R Giugno, D Shasha
    posted to algorithms data_structure graph kdd by AbnerCYH on 2007-12-06 16:38:19 as ** along with 1 person bigbossman
  • Design and implementation of an efficient priority queue
    Theory of Computing Systems, Vol. 10, No. 1. (1 December 1976), pp. 99-127.
    by van Emde, R Kaas, E Zijlstra
    posted to algorithms data_structure by AbnerCYH on 2007-11-16 13:47:00 as **
  • Should Tables Be Sorted?
    J. ACM, Vol. 28, No. 3. (July 1981), pp. 615-628.
    by Andrew C Yao
    posted to algorithms complexity data_structure order by AbnerCYH on 2007-10-23 14:21:19 as ** along with 1 person mangesh
  • The cell probe complexity of dynamic data structures
    (1989), pp. 345-354.
    by M Fredman, M Saks
    posted to algorithms complexity data_structure by AbnerCYH on 2007-10-19 17:38:31 as **
  • Data structures and algorithms for disjoint set union problems
    ACM Comput. Surv., Vol. 23, No. 3. (September 1991), pp. 319-344.
    by Zvi Galil, Giuseppe F Italiano
    posted to algorithms data_structure by AbnerCYH on 2007-10-12 05:51:16 as **
  • Self-Adjusting Heaps
    SIAM Journal on Computing, Vol. 15, No. 1. (1986), pp. 52-69.
    by Daniel D Sleator, Robert E Tarjan
    posted to algorithms data_structure graph by AbnerCYH on 2007-08-08 15:53:09 as ** along with 1 group CSBBGraphTheory
  • Fibonacci heaps and their uses in improved network optimization algorithms
    J. ACM, Vol. 34, No. 3. (July 1987), pp. 596-615.
    by Michael L Fredman, Robert E Tarjan
    posted to algorithms data_structure graph by AbnerCYH on 2007-08-08 11:37:11 as ** along with 1 person and 1 group jorgevillaverde CSBBGraphTheory
  • Applications of Path Compression on Balanced Trees
    J. ACM, Vol. 26, No. 4. (October 1979), pp. 690-715.
    by Robert E Tarjan
    posted to algorithms data_structure graph by AbnerCYH on 2007-08-08 09:44:48 as ** along with 1 group CSBBGraphTheory
    • Note: You may cite this page as: http://www.citeulike.org/user/AbnerCYH/tag/data_structure

    RIS BibTeX RSS
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.