Sciweavers

969 search results - page 20 / 194
» Generalized matching from theory to application
Sort
View
IJCV
2008
157views more  IJCV 2008»
13 years 7 months ago
A General Method for Sensor Planning in Multi-Sensor Systems: Extension to Random Occlusion
Systems utilizing multiple sensors are required in many domains. In this paper, we specifically concern ourselves with applications where dynamic objects appear randomly and the s...
Anurag Mittal, Larry S. Davis
LICS
2009
IEEE
14 years 2 months ago
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
Jérôme Leroux
TNN
2008
105views more  TNN 2008»
13 years 7 months ago
Generalized Linear Discriminant Analysis: A Unified Framework and Efficient Model Selection
Abstract--High-dimensional data are common in many domains, and dimensionality reduction is the key to cope with the curse-of-dimensionality. Linear discriminant analysis (LDA) is ...
Shuiwang Ji, Jieping Ye
PASTE
2005
ACM
14 years 1 months ago
Generalizing symbolic execution to library classes
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...
Sarfraz Khurshid, Yuk Lai Suen
CVPR
2010
IEEE
14 years 4 months ago
Scalable Active Matching
In matching tasks in computer vision, and particularly in real-time tracking from video, there are generally strong priors available on absolute and relative correspondence locati...
Ankur Handa, Margarita Chli, Hauke Strasdat, Andre...