7486 search results - page 1305 / 1498 » The Limits of Quantum Computers |
189
click to vote
STACS
2005
Springer
16 years 1 days ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
169
click to vote
CP
2005
Springer
16 years 20 hour ago
2005
Springer
While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more estab...
176
click to vote
ACMICEC
2004
ACM
16 years 2 hour ago
2004
ACM
Public administrations of all over the world invest an enormous amount of resources in e-government. How the success of egovernment can be measured is often not clear. E-governmen...
215
click to vote
AFRIGRAPH
2004
ACM
16 years 1 hour ago
2004
ACM
We describe techniques for exploring 3D scenes by combining non-linear projections with the interactive data mining of camera navigations from previous explorations. Our approach ...
172
click to vote
APGV
2004
ACM
16 years 1 hour ago
2004
ACM
Studies have shown that although shading can give an image a ”natural” look and is an important shape cue, visual perception of surface shape from shading only is severely lim...