215 search results - page 27 / 43 » Indeterminacy and Rough Approximation |
COMPGEOM
2011
ACM
13 years 6 days 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...
SIAMCOMP
1998
13 years 8 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
PODC
2006
ACM
14 years 2 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
EUROCRYPT
2005
Springer
14 years 2 months ago
2005
Springer
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
FGR
2004
IEEE
14 years 10 days ago
2004
IEEE
This paper proposes a method of determining human head poses from a sequence of images. The main idea is to use some features in a 3D head model to generate a virtual fronto-paral...