Sciweavers

215 search results - page 12 / 43
» On the Linear Number of Matching Substrings
Sort
View
COMPGEOM
1996
ACM
14 years 2 days ago
Linear Complexity Hexahedral Mesh Generation
We show that any simply connected (but not necessarily convex) polyhedron with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face t...
David Eppstein
CVPR
2010
IEEE
14 years 2 months ago
One-Shot Multi-Set Non-rigid Feature-Spatial Matching
We introduce a novel framework for nonrigid feature matching among multiple sets in a way that takes into consideration both the feature descriptor and the features spatial arra...
Marwan Torki and Ahmed Elgammal
SIAMDM
2010
95views more  SIAMDM 2010»
13 years 2 months ago
Voting Paths
We consider a matching market, in which the aim is to maintain a popular matching between a set of applicants and a set of posts, where each applicant has a preference list rankin...
David J. Abraham, Telikepalli Kavitha
DAC
2000
ACM
14 years 8 days ago
An asymptotically constant, linearly bounded methodology for the statistical simulation of analog circuits including component m
Abstract: This paper presents a new statistical methodology to simulate the effect of both inter-die and intra-die variation on the electrical performance of analog integrated circ...
Carlo Guardiani, Sharad Saxena, Patrick McNamara, ...
CVPR
2000
IEEE
14 years 10 months ago
Reliable Feature Matching across Widely Separated Views
In this paper we present a robust method for automatically matching features in images corresponding to the same physical point on an object seen from two arbitrary viewpoints. Un...
Adam Baumberg