2434 search results - page 266 / 487 » Algorithmic Randomness of Closed Sets |
126
click to vote
CIKM
2011
Springer
14 years 4 months ago
2011
Springer
Typically, users interact with database systems by formulating queries. However, many times users do not have a clear understanding of their information needs or the exact content...
191
Voted
JMLR
2012
13 years 6 months ago
2012
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model...
146
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
164
click to vote
KAIS
2011
14 years 11 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
151
click to vote
PODC
2003
ACM
15 years 9 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...