Sciweavers

4212 search results - page 296 / 843
» On Compressible Pairings and Their Computation
Sort
View
ICCD
2001
IEEE
103views Hardware» more  ICCD 2001»
16 years 3 months ago
Fixed-outline Floorplanning through Better Local Search
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...
Saurabh N. Adya, Igor L. Markov
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
16 years 1 months ago
Geometric Minimum Spanning Trees with GeoFilterKruskal
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
Samidh Chatterjee, Michael Connor, Piyush Kumar
DASFAA
2006
IEEE
183views Database» more  DASFAA 2006»
16 years 25 days ago
Probabilistic Similarity Join on Uncertain Data
An important database primitive for commonly used feature databases is the similarity join. It combines two datasets based on some similarity predicate into one set such that the n...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
CA
1998
IEEE
15 years 11 months ago
Feature-based Surface Decomposition for Correspondence and Morphing Between Polyhedra
We present a new approach for establishing correspondence between two homeomorphic 3D polyhedral models. The user can specify corresponding feature pairs on the polyhedra with a s...
Arthur D. Gregory, Andrei State, Ming C. Lin, Dine...
CVPR
1997
IEEE
15 years 11 months ago
Automatic line matching across views
This paper presents a new method for matching individual line segments between images. The method uses both greylevel information and the multiple view geometric relations between...
Cordelia Schmid, Andrew Zisserman