5169 search results - page 979 / 1034 » Locality approximation using time |
110
Voted
STOC
2009
ACM
16 years 3 months ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
110
Voted
CHI
2009
ACM
16 years 3 months ago
2009
ACM
This paper reports results from a study in which we automatically classified the query reformulation patterns for 964,780 Web searching sessions (composed of 1,523,072 queries) in...
218
Voted
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
218
Voted
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
The skyline of a d-dimensional dataset consists of all points not dominated by others. The incorporation of the skyline operator into practical database systems necessitates an ef...
290
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...