Sciweavers

4761 search results - page 638 / 953
» Generalizing Boundary Points
Sort
View
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
15 years 10 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian
SIGGRAPH
1989
ACM
15 years 10 months ago
Algorithms for solid noise synthesis
A solid noise is a function that defines a random value at each point in space. Solid noises have immediate and powerful applications in surface texturing, stochastic modeling, a...
J. P. Lewis
AOSD
2009
ACM
15 years 10 months ago
The dataflow pointcut: a formal and practical framework
Some security concerns are sensitive to flow of information in a program execution. The dataflow pointcut has been proposed by Masuhara and Kawauchi in order to easily implement s...
Dima Alhadidi, Amine Boukhtouta, Nadia Belblidia, ...
COMPGEOM
2010
ACM
15 years 10 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
SIGIR
2010
ACM
15 years 10 months ago
Freshness matters: in flowers, food, and web authority
The collective contributions of billions of users across the globe each day result in an ever-changing web. In verticals like news and real-time search, recency is an obvious sign...
Na Dai, Brian D. Davison