1068 search results - page 82 / 214 » For completeness, sublogarithmic space is no space |
129
Voted
CVPR
1997
IEEE
16 years 3 months ago
1997
IEEE
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...
113
Voted
AAAI
2000
15 years 3 months ago
2000
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...
120
click to vote
IJRR
2008
15 years 1 months ago
2008
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...
99
Voted
ICCAD
2009
IEEE
14 years 11 months ago
2009
IEEE
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...
144
Voted
ICCAD
2009
IEEE
14 years 11 months ago
2009
IEEE
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...