Sciweavers

1688 search results - page 190 / 338
» The Complexity of Rationalizing Matchings
Sort
View
ICCV
1995
IEEE
15 years 3 months ago
Object Indexing Using an Iconic Sparse Distributed Memory
A general-purpose object indexingtechnique is described that combines the virtues of principal component analysis with the favorable matching properties of high-dimensional spaces...
Rajesh P. N. Rao, Dana H. Ballard
CVPR
2010
IEEE
15 years 2 months ago
Bundled Depth-Map Merging for Multi-View Stereo
Depth-map merging is one typical technique category for multi-view stereo (MVS) reconstruction. To guarantee accuracy, existing algorithms usually require either sub-pixel level s...
Jianguo Li
AAAI
2007
15 years 1 months ago
Knowledge Compilation Properties of Tree-of-BDDs
We present a CNF to Tree-of-BDDs (ToB) compiler with complexity at most exponential in the tree width. We then present algorithms for interesting queries on ToB. Although some of ...
Sathiamoorthy Subbarayan, Lucas Bordeaux, Youssef ...
ICWS
2007
IEEE
15 years 28 days ago
A Query-based System for Automatic Invocation of Web Services
There is a critical need to design and develop tools tract away the fundamental complexity of XML based Web services specifications and toolkits, and provide an elegant, intuitive...
Chaitali Gupta, Rajdeep Bhowmik, Michael R. Head, ...
IPCV
2007
15 years 28 days ago
Tracking Multiple Sports Players for Mobile Display
- An architecture system and a method for tracking people are presented for sports applications. The system’s input is video data from static camera and the output is the real wo...
Andreas Aristidou, Paul Pangalos, Hamid Aghvami