Sciweavers

1702 search results - page 174 / 341
» Doomed program points
Sort
View
MODELS
2009
Springer
15 years 10 months ago
An Example Is Worth a Thousand Words: Composite Operation Modeling By-Example
Abstract. Predefined composite operations are handy for efficient modeling, e.g., for the automatic execution of refactorings, and for the introduction of patterns in existing mod...
Petra Brosch, Philip Langer, Martina Seidl, Konrad...
152
Voted
COMPGEOM
1991
ACM
15 years 9 months ago
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
David Avis, Komei Fukuda
153
Voted
ICVGIP
2004
15 years 7 months ago
Local Correlation-based Fingerprint Matching
Most fingerprint matching systems are based on matching minutia points between two fingerprint images. Each minutia is represented by a fixed number of attributes such as the loca...
Karthik Nandakumar, Anil K. Jain
EOR
2010
102views more  EOR 2010»
15 years 6 months ago
The Tree of Hubs Location Problem
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
Iván A. Contreras, Elena Fernández, ...
JGTOOLS
2006
199views more  JGTOOLS 2006»
15 years 6 months ago
Fast Approximation of High-Order Voronoi Diagrams and Distance Transforms on the GPU
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
Ian Fischer, Craig Gotsman