Sciweavers

214 search results - page 29 / 43
» Foundations of probabilistic answers to queries
Sort
View
BIBM
2010
IEEE
139views Bioinformatics» more  BIBM 2010»
13 years 5 months ago
Scalable, updatable predictive models for sequence data
The emergence of data rich domains has led to an exponential growth in the size and number of data repositories, offering exciting opportunities to learn from the data using machin...
Neeraj Koul, Ngot Bui, Vasant Honavar
SDM
2009
SIAM
129views Data Mining» more  SDM 2009»
14 years 5 months ago
Multi-topic Based Query-Oriented Summarization.
Query-oriented summarization aims at extracting an informative summary from a document collection for a given query. It is very useful to help users grasp the main information rel...
Dewei Chen, Jie Tang, Limin Yao
SIGOPS
2010
126views more  SIGOPS 2010»
13 years 6 months ago
Scaling a monitoring infrastructure for the Akamai network
We describe the design of, and experience with, Query, a monitoring system that supports the Akamai EdgePlatform. Query is a foundation of Akamai’s approach to administering its...
Thomas Repantis, Jeff Cohen, Scott Smith, Joel Wei...
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
14 years 10 months ago
Sketch-Based Summarization of Ordered XML Streams
XML streams, such as RSS feeds or complex event streams, are becoming increasingly pervasive as they provide the foundation for a wide range of emerging applications. An important...
Veronica Mayorga, Neoklis Polyzotis
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 8 hour ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko