Sciweavers

13559 search results - page 2392 / 2712
» Information Retrieval on the Web
Sort
View
PODS
2006
ACM
216views Database» more  PODS 2006»
16 years 7 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
EDBT
2004
ACM
172views Database» more  EDBT 2004»
16 years 7 months ago
Content-Based Routing of Path Queries in Peer-to-Peer Systems
Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in whic...
Georgia Koloniari, Evaggelia Pitoura
MOBIHOC
2006
ACM
16 years 6 months ago
Data storage placement in sensor networks
Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces stora...
Bo Sheng, Qun Li, Weizhen Mao
159
Voted
DCC
2007
IEEE
16 years 6 months ago
Nonuniform Compression in Databases with Haar Wavelet
Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the data from ...
S. Chen, A. Nucci
SDM
2009
SIAM
140views Data Mining» more  SDM 2009»
16 years 4 months ago
Straightforward Feature Selection for Scalable Latent Semantic Indexing.
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...
Jun Yan, Shuicheng Yan, Ning Liu, Zheng Chen
« Prev « First page 2392 / 2712 Last » Next »