5100 search results - page 781 / 1020 » The Linear Complexity of a Graph |
246
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
201
click to vote
COCO
2011
Springer
14 years 6 months ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
185
click to vote
CRYPTO
2012
Springer
13 years 9 months ago
2012
Springer
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
215
click to vote
PODC
2012
ACM
13 years 9 months ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
196
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...