Sciweavers

513 search results - page 99 / 103
» Finitely Based, Finite Sets of Words
Sort
View
TVCG
1998
127views more  TVCG 1998»
13 years 7 months ago
Dynamic Catmull-Clark Subdivision Surfaces
—Recursive subdivision schemes have been extensively used in computer graphics, computer-aided geometric design, and scientific visualization for modeling smooth surfaces of arbi...
Hong Qin, Chhandomay Mandal, Baba C. Vemuri
TALG
2010
158views more  TALG 2010»
13 years 2 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...

Publication
151views
12 years 6 months ago
Embedding Overlap Priors in Variational Left Ventricle Tracking
Tracking heart motion plays an essential role in the diagnosis of cardiovascular diseases. This study investigates overlap priors for variational tracking of the Left Ventricle (LV...
Ismail Ben Ayed, Shuo Li and Ian Ross
ECCV
2002
Springer
14 years 9 months ago
Learning Shape from Defocus
We present a novel method for inferring three-dimensional shape from a collection of defocused images. It is based on the observation that defocused images are the null-space of ce...
Paolo Favaro, Stefano Soatto
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
14 years 7 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin