Sciweavers

2413 search results - page 448 / 483
» Understanding the problem
Sort
View
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
15 years 2 months ago
Small Spans in Scaled Dimension
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
John M. Hitchcock
CCS
2006
ACM
15 years 2 months ago
A scalable approach to attack graph generation
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...
Xinming Ou, Wayne F. Boyer, Miles A. McQueen
COLT
2006
Springer
15 years 2 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
ECCV
2006
Springer
15 years 2 months ago
Segmentation and Guidance of Multiple Rigid Objects for Intra-operative Endoscopic Vision
Abstract. This paper presents an endoscopic vision framework for modelbased 3D guidance of surgical instruments used in robotized laparoscopic surgery. In order to develop such a s...
Christophe Doignon, Florent Nageotte, Michel de Ma...
KR
2000
Springer
15 years 2 months ago
Reasoning with Axioms: Theory and Practice
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
Ian Horrocks, Stephan Tobies