Sciweavers

1088 search results - page 172 / 218
» Probabilistic query expansion using query logs
Sort
View
PODS
2003
ACM
143views Database» more  PODS 2003»
14 years 9 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
OSDI
2006
ACM
14 years 9 months ago
Flight Data Recorder: Monitoring Persistent-State Interactions to Improve Systems Management
Mismanagement of the persistent state of a system--all the executable files, configuration settings and other data that govern how a system functions--causes reliability problems,...
Chad Verbowski, Emre Kiciman, Arunvijay Kumar, Bra...
WSDM
2010
ACM
315views Data Mining» more  WSDM 2010»
14 years 6 months ago
SBotMiner: Large Scale Search Bot Detection
In this paper, we study search bot traffic from search engine query logs at a large scale. Although bots that generate search traffic aggressively can be easily detected, a large ...
Fang Yu, Yinglian Xie, Qifa Ke
COMPGEOM
2006
ACM
14 years 2 months ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
14 years 9 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano