13603 search results - page 2509 / 2721 » On the computational complexity of bridgecard |
340
click to vote
EH
1999
IEEE
1999
IEEE
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
15 years 11 months ago
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
208
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
214
Voted
ICCV
1999
IEEE
15 years 11 months ago
1999
IEEE
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
183
click to vote
ICDCS
1999
IEEE
15 years 11 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
175
click to vote
RT
1999
Springer
15 years 11 months ago
1999
Springer
There is a need for reliable lighting design applications because available tools are limited and inappropriate for interactive or creative use. Architects and lighting designers ...