Sciweavers

372 search results - page 25 / 75
» The box mover problem
Sort
View
IJCV
2006
115views more  IJCV 2006»
13 years 7 months ago
Object Recognition as Many-to-Many Feature Matching
Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation e...
M. Fatih Demirci, Ali Shokoufandeh, Yakov Keselman...
SODA
2003
ACM
158views Algorithms» more  SODA 2003»
13 years 8 months ago
Faster approximation algorithms for the minimum latency problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, David P. Williamson
AES
2007
Springer
92views Cryptology» more  AES 2007»
13 years 7 months ago
MicroARTMAP for pattern recognition problems
Pattern recognition is an important aspect of a dominant technology such as machine intelligence. Domain specific fuzzy-neuro models particularly for the ‘black box’ implemen...
Sundaramoorthy Rajasekaran, Vasantha Kalyani David
AI
2001
Springer
13 years 12 months ago
Search Techniques for Non-linear Constraint Satisfaction Problems with Inequalities
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
ISPD
1999
ACM
79views Hardware» more  ISPD 1999»
13 years 11 months ago
Partitioning with terminals: a "new" problem and new benchmarks
The presence of fixed terminals in hypergraph partitioning instances arising in top-down standard-cell placement makes such instances qualitatively different from the free hyperg...
Charles J. Alpert, Andrew E. Caldwell, Andrew B. K...