Sciweavers

1604 search results - page 231 / 321
» Regularization on Discrete Spaces
Sort
View
COMPGEOM
2006
ACM
14 years 4 months ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir
PODC
2006
ACM
14 years 4 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
IMC
2004
ACM
14 years 3 months ago
Constraint-based geolocation of internet hosts
— Geolocation of Internet hosts enables a diverse and interesting new class of location-aware applications. Previous measurement-based approaches use reference hosts, called land...
Bamba Gueye, Artur Ziviani, Mark Crovella, Serge F...
ECCV
2004
Springer
14 years 3 months ago
CT from an Unmodified Standard Fluoroscopy Machine Using a Non-reproducible Path
3D reconstruction from image data is required in many medical procedures. Recently, the use of fluoroscopy data to generate these 3D models has been explored. Most existing methods...
Chris Baker, Christian Debrunner, Mohamed Mahfouz,...
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
14 years 2 months ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...