Sciweavers

1283 search results - page 158 / 257
» Probabilistic structured query methods
Sort
View
EDBT
2006
ACM
190views Database» more  EDBT 2006»
14 years 9 months ago
Fast Approximate Wavelet Tracking on Streams
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
Graham Cormode, Minos N. Garofalakis, Dimitris Sac...
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 2 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
BIBM
2009
IEEE
206views Bioinformatics» more  BIBM 2009»
14 years 3 months ago
Application of Kernel Functions for Accurate Similarity Search in Large Chemical Databases
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
Xiaohong Wang, Jun Huan, Aaron M. Smalter, Gerald ...
ECAI
2010
Springer
13 years 7 months ago
From bursty patterns to bursty facts: The effectiveness of temporal text mining for news
Many document collections are by nature dynamic, evolving as the topics or events they describe change. The goal of temporal text mining is to discover bursty patterns and to ident...
Ilija Subasic, Bettina Berendt
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
14 years 9 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis