Sciweavers

868 search results - page 111 / 174
» A general compression algorithm that supports fast searching
Sort
View
128
Voted
CIKM
2005
Springer
15 years 9 months ago
Concept-based interactive query expansion
Despite the recent advances in search quality, the fast increase in the size of the Web collection has introduced new challenges for Web ranking algorithms. In fact, there are sti...
Bruno M. Fonseca, Paulo Braz Golgher, Bruno P&ocir...
227
Voted
ICDE
2005
IEEE
103views Database» more  ICDE 2005»
16 years 5 months ago
Vectorizing and Querying Large XML Repositories
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutc...
105
Voted
JVCIR
2010
177views more  JVCIR 2010»
15 years 2 months ago
Ripplet: A new transform for image processing
Efficient representation of images usually leads to improvements in storage efficiency, computational complexity and performance of image processing algorithms. Efficient represe...
Jun Xu, Lei Yang, Dapeng Wu
105
Voted
MSWIM
2005
ACM
15 years 9 months ago
YAES: a modular simulator for mobile networks
Developing network protocols for mobile wireless systems is a complex task, and most of the existing simulator frameworks are not well suited for experimental development. The YAE...
Ladislau Bölöni, Damla Turgut
115
Voted
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
16 years 27 days ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...