12052 search results - page 690 / 2411 » computing 2010 |
180
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
239
click to vote
TCOS
2010
15 years 5 months ago
2010
We present a general framework for computing two-dimensional Voronoi diagrams of different classes of sites under various distance functions. Most diagrams mentioned in the paper ...
180
Voted
SAC
2010
ACM
16 years 17 days ago
2010
ACM
In this paper we present the first framework that allows the creation of Secret Interest Groups (SIGs) in Online Social Networks; SIGs are self managed groups formed outside of t...
179
click to vote
COMGEO
2010
ACM
15 years 7 months ago
2010
ACM
We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S Rd with running time subexponential in d. The alg...
175
click to vote
PODC
2010
ACM
15 years 9 months ago
2010
ACM
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...