Sciweavers

1068 search results - page 82 / 214
» For completeness, sublogarithmic space is no space
Sort
View
CVPR
1997
IEEE
14 years 10 months ago
Pictorial Recognition Using Affine-Invariant Spectral Signatures
This paper describes an efficient approach to pose invariant object recognition employing pictorial recognition of image patches. A complete affine invariance is achieved by a rep...
Jezekiel Ben-Arie, Zhiqian Wang
AAAI
2000
13 years 10 months ago
Generating Satisfiable Problem Instances
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
Dimitris Achlioptas, Carla P. Gomes, Henry A. Kaut...
IJRR
2008
100views more  IJRR 2008»
13 years 8 months ago
Comparing the Power of Robots
Robots must complete their tasks in spite of unreliable actuators and limited, noisy sensing. In this paper, we consider the information requirements of such tasks. What sensing a...
Jason M. O'Kane, Steven M. LaValle
ICCAD
2009
IEEE
106views Hardware» more  ICCAD 2009»
13 years 6 months ago
An efficient pre-assignment routing algorithm for flip-chip designs
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...
Po-Wei Lee, Chung-Wei Lin, Yao-Wen Chang, Chin-Fan...
ICCAD
2009
IEEE
147views Hardware» more  ICCAD 2009»
13 years 6 months ago
SAT-based protein design
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...