Sciweavers

557 search results - page 58 / 112
» On the set multi-cover problem in geometric settings
Sort
View
SMA
2006
ACM
107views Solid Modeling» more  SMA 2006»
14 years 3 months ago
Solving topological constraints for declarative families of objects
Parametric and feature-based CAD models can be considered to represent families of similar objects. In current modelling systems, however, the semantics of such families are uncle...
Hilderick A. van der Meiden, Willem F. Bronsvoort
GECCO
2005
Springer
162views Optimization» more  GECCO 2005»
14 years 2 months ago
Evolution of Voronoi based fuzzy recurrent controllers
A fuzzy controller is usually designed by formulating the knowledge of a human expert into a set of linguistic variables and fuzzy rules. Among the most successful methods to auto...
Carlos Kavka, Patricia Roggero, Marc Schoenauer
SGP
2007
13 years 11 months ago
Triangulations with locally optimal Steiner points
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
Hale Erten, Alper Üngör
IJCV
2000
225views more  IJCV 2000»
13 years 8 months ago
Depth from Defocus vs. Stereo: How Different Really Are They?
Depth from Focus (DFF) and Depth from Defocus (DFD) methods are theoretically unified with the geometric triangulation principle. Fundamentally, the depth sensitivities of DFF and ...
Yoav Y. Schechner, Nahum Kiryati
MOBIHOC
2010
ACM
13 years 7 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan