Sciweavers

452 search results - page 18 / 91
» PDE-based fast local level set method
Sort
View
124
Voted
CVPR
2004
IEEE
16 years 1 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
128
Voted
TMC
2010
179views more  TMC 2010»
14 years 10 months ago
On Fast and Accurate Detection of Unauthorized Wireless Access Points Using Clock Skews
We explore the use of clock skew of a wireless local area network access point (AP) as its fingerprint to detect unauthorized APs quickly and accurately. The main goal behind usi...
Suman Jana, Sneha Kumar Kasera
121
Voted
ECCV
2010
Springer
15 years 4 months ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov
GRAPHICSINTERFACE
2009
14 years 9 months ago
Fast visualization of complex 3D models using displacement mapping
We present a simple method to render complex 3D models at interactive rates using real-time displacement mapping. We use an octree to decompose the 3D model into a set of height f...
The-Kiet Lu, Kok-Lim Low, Jianmin Zheng
HM
2005
Springer
140views Optimization» more  HM 2005»
15 years 5 months ago
Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows
Abstract. This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejec...
Herman Sontrop, Pieter van der Horn, Marc Uetz