Sciweavers

2661 search results - page 272 / 533
» Quantum Complexity Classes
Sort
View
CGO
2007
IEEE
15 years 10 months ago
Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time
Emerging microprocessors offer unprecedented parallel computing capabilities and deeper memory hierarchies, increasing the importance of loop transformations in optimizing compile...
Louis-Noël Pouchet, Cédric Bastoul, Al...
DATE
2007
IEEE
155views Hardware» more  DATE 2007»
15 years 10 months ago
Design fault directed test generation for microprocessor validation
Functional validation of modern microprocessors is an important and complex problem. One of the problems in functional validation is the generation of test cases that has higher p...
Deepak Mathaikutty, Sandeep K. Shukla, Sreekumar V...
FOCS
2007
IEEE
15 years 10 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx
ICIP
2007
IEEE
15 years 10 months ago
A Novel Kernel Discriminant Analysis for Face Verification
In this paper a novel non-linear subspace method for face verification is proposed. The problem of face verification is considered as a two-class problem (genuine versus imposto...
Georgios Goudelis, Stefanos Zafeiriou, Anastasios ...
IROS
2007
IEEE
188views Robotics» more  IROS 2007»
15 years 10 months ago
Behavior maps for online planning of obstacle negotiation and climbing on rough terrain
Abstract— To autonomously navigate on rough terrain is a challenging problem for mobile robots, requiring the ability to decide whether parts of the environment can be traversed ...
Christian Dornhege, Alexander Kleiner