Sciweavers

1284 search results - page 160 / 257
» Data Structures for Mergeable Trees
Sort
View
ERLANG
2003
ACM
15 years 7 months ago
A study of Erlang ETS table implementations and performance
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
Scott Lystig Fritchie
126
Voted
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
15 years 7 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
117
Voted
KES
2004
Springer
15 years 7 months ago
Content-Based Image Retrieval Using Multiple Representations
Many different approaches for content-based image retrieval have been proposed in the literature. Successful approaches consider not only simple features like color, but also take ...
Karin Kailing, Hans-Peter Kriegel, Stefan Schö...
VISUALIZATION
2005
IEEE
15 years 8 months ago
Distributed Data Management for Large Volume Visualization
We propose a distributed data management scheme for large data visualization that emphasizes efficient data sharing and access. To minimize data access time and support users wit...
Jinzhu Gao, Jian Huang, C. Ryan Johnson, Scott Atc...
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
15 years 8 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...