Sciweavers

2925 search results - page 15 / 585
» Information Complexity of Online Problems
Sort
View
112
Voted
CVPR
2003
IEEE
16 years 3 months ago
Fusing Online and Offline Information for Stable 3D Tracking in Real-Time
We propose an efficient online real-time solution for singlecamera 3?D tracking of rigid objects that can handle large camera displacements, drastic aspect changes, and partial oc...
Luca Vacchetti, Vincent Lepetit, Pascal Fua
EUROSYS
2006
ACM
15 years 11 months ago
Solving the starting problem: device drivers as self-describing artifacts
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
Michael F. Spear, Tom Roeder, Orion Hodson, Galen ...
ICDCS
2012
IEEE
13 years 4 months ago
Tiresias: Online Anomaly Detection for Hierarchical Operational Network Data
Operational network data, management data such as customer care call logs and equipment system logs, is a very important source of information for network operators to detect prob...
Chi-Yao Hong, Matthew Caesar, Nick G. Duffield, Ji...
APPROX
2009
Springer
118views Algorithms» more  APPROX 2009»
15 years 8 months ago
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
T. S. Jayram
FOGA
2011
14 years 5 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly