Sciweavers

3223 search results - page 348 / 645
» The Scaling of Search Cost
Sort
View
DBA
2006
236views Database» more  DBA 2006»
15 years 8 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...
AAAI
1998
15 years 8 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
15 years 6 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
WWW
2008
ACM
16 years 7 months ago
Finding the right facts in the crowd: factoid question answering over social media
Community Question Answering has emerged as a popular and effective paradigm for a wide range of information needs. For example, to find out an obscure piece of trivia, it is now ...
Jiang Bian, Yandong Liu, Eugene Agichtein, Hongyua...
WWW
2007
ACM
16 years 7 months ago
GigaHash: scalable minimal perfect hashing for billions of urls
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
Kumar Chellapilla, Anton Mityagin, Denis Xavier Ch...