Sciweavers

1629 search results - page 211 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 2 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
INFOCOM
2011
IEEE
14 years 1 months ago
Sensor localization with deterministic accuracy guarantee
—Localizability of network or node is an important subproblem in sensor localization. While rigidity theory plays an important role in identifying several localizability conditio...
Ryo Sugihara, Rajesh K. Gupta
ATAL
2009
Springer
15 years 4 months ago
Graph-based methods for the analysis of large-scale multiagent systems
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
Wilbur Peng, William Krueger, Alexander Grushin, P...
NIPS
2000
14 years 11 months ago
On Reversing Jensen's Inequality
Jensen's inequality is a powerful mathematical tool and one of the workhorses in statistical learning. Its applications therein include the EM algorithm, Bayesian estimation ...
Tony Jebara, Alex Pentland
ICASSP
2007
IEEE
15 years 4 months ago
Stationary-Tones Interference Cancellation using Adaptive Tracking
It is usual in practice that recorded sounds are contaminated by stationary tones coming from power wiring (50/60 Hz or 400 Hz and their harmonics), frame or line frequencies from...
Ivan Tashev, Henrique S. Malvar