Sciweavers

5144 search results - page 831 / 1029
» Enhancing Search with Structure
Sort
View
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
16 years 7 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
16 years 6 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
16 years 6 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
16 years 6 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
WWW
2010
ACM
16 years 1 months ago
RankCompete: simultaneous ranking and clustering of web photos
With the explosive growth of digital cameras and online media, it has become crucial to design efficient methods that help users browse and search large image collections. The rec...
Liangliang Cao, Andrey Del Pozo, Xin Jin, Jiebo Lu...