515 search results - page 32 / 103 » Classroom Examples of Robustness Problems in Geometric Compu... |
CVPR
2001
IEEE
15 years 11 months ago
2001
IEEE
All positive examples are alike; each negative example is negative in its own way. During interactive multimedia information retrieval, the number of training samples fed-back by ...
CGF
2010
14 years 10 months ago
2010
Many problems in geometric modeling can be described using variational formulations that define the smoothness of the shape and its behavior w.r.t. the posed modeling constraints....
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
132
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We present a region-based active contour detection algorithm
for objects that exhibit relatively homogeneous photometric
characteristics (e.g. smooth color or gray levels),
embe...
100
click to vote
SPAA
2003
ACM
15 years 3 months ago
2003
ACM
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...