1066 search results - page 148 / 214 » Computing Private Set Operations with Linear Complexities |
208
Voted
GIS
2008
ACM
16 years 3 months ago
2008
ACM
We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data use...
144
Voted
TCS
2010
15 years 1 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
179
Voted
COMPGEOM
2011
ACM
14 years 6 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...
162
Voted
ECCV
2004
Springer
16 years 4 months ago
2004
Springer
This paper presents a Bayesian framework for multi-cue 3D object tracking of deformable objects. The proposed spatio-temporal object representation involves a set of distinct linea...
112
Voted
SCALESPACE
2007
Springer
15 years 9 months ago
2007
Springer
Incorporating shape priors in image segmentation has become a key problem in computer vision. Most existing work is limited to a linearized shape space with small deformation modes...