Sciweavers

4874 search results - page 271 / 975
» Information theory for data management
Sort
View
CIKM
2008
Springer
15 years 8 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
ICDE
2008
IEEE
153views Database» more  ICDE 2008»
16 years 8 months ago
A Framework for Clustering Uncertain Data Streams
Abstract-- In recent years, uncertain data management applications have grown in importance because of the large number of hardware applications which measure data approximately. F...
Charu C. Aggarwal, Philip S. Yu
ANCS
2008
ACM
15 years 8 months ago
On runtime management in multi-core packet processing systems
Computer networks require increasingly complex packet processing in the data path to adapt to new functionality requirements. To meet performance demands, packet processing system...
Qiang Wu, Tilman Wolf
WWW
2003
ACM
16 years 7 months ago
Mining newsgroups using networks arising from social behavior
Recent advances in information retrieval over hyperlinked corpora have convincinglydemonstratedthat links carry less noisy information than text. We investigate the feasibility of...
Rakesh Agrawal, Sridhar Rajagopalan, Ramakrishnan ...
DAC
2002
ACM
16 years 7 months ago
Compiler-directed scratch pad memory hierarchy design and management
One of the primary challenges in embedded system design is designing the memory hierarchy and restructuring the application to take advantage of it. This task is particularly impo...
Mahmut T. Kandemir, Alok N. Choudhary