Sciweavers

2600 search results - page 202 / 520
» Clustering with or without the Approximation
Sort
View
WSCG
2004
174views more  WSCG 2004»
15 years 8 months ago
Objects and Occlusion from Motion Labeling
The problem of segmenting color video sequences is addressed. Boundary motion and occlusion relations expressed by labeling rules are argued to be of key importance for segmentati...
Albert Akhriev, Alexander Bonch-Osmolovsky, Alexan...
CAGD
2005
130views more  CAGD 2005»
15 years 6 months ago
Truly selective polygonal mesh hierarchies with error control
In this work a new multi-resolution model is proposed for polygonal meshes. It is based on the dual edge collapse, which performs face clustering instead of vertex clustering. The...
Stefan Gumhold
COMPGEOM
2004
ACM
16 years 2 hour ago
Locality-sensitive hashing scheme based on p-stable distributions
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab ...
DAC
1996
ACM
15 years 10 months ago
A Sparse Image Method for BEM Capacitance Extraction
Boundary element methods (BEM) are often used for complex 3-D capacitance extraction because of their efficiency, ease of data preparation, and automatic handling of open regions. ...
Byron Krauter, Yu Xia, E. Aykut Dengi, Lawrence T....
DAM
2010
112views more  DAM 2010»
15 years 6 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson