Sciweavers

4781 search results - page 115 / 957
» Complexity at large
Sort
View
MFCS
2009
Springer
14 years 4 months ago
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf ...
IJRR
2010
177views more  IJRR 2010»
13 years 8 months ago
Learning from Demonstration for Autonomous Navigation in Complex Unstructured Terrain
Rough terrain autonomous navigation continues to pose a challenge to the robotics community. Robust navigation by a mobile robot depends not only on the individual performance of ...
David Silver, J. Andrew Bagnell, Anthony Stentz
IJCV
2008
191views more  IJCV 2008»
13 years 10 months ago
Searching for Complex Human Activities with No Visual Examples
Abstract We describe a method of representing human activities that allows a collection of motions to be queried without examples, using a simple and effective query language. Our ...
Nazli Ikizler, David A. Forsyth
ICSE
2012
IEEE-ACM
12 years 16 days ago
Performance debugging in the large via mining millions of stack traces
—Given limited resource and time before software release, development-site testing and debugging become more and more insufficient to ensure satisfactory software performance. As...
Shi Han, Yingnong Dang, Song Ge, Dongmei Zhang, Ta...
ATAL
2005
Springer
14 years 3 months ago
An online POMDP algorithm for complex multiagent environments
In this paper, we present an online method for POMDPs, called RTBSS (Real-Time Belief Space Search), which is based on a look-ahead search to find the best action to execute at e...
Sébastien Paquet, Ludovic Tobin, Brahim Cha...