166 search results - page 10 / 34 » Tighter Bounds for Structured Estimation |
INFOCOM
2012
IEEE
12 years 8 days ago
2012
IEEE
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
ICRA
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— In this paper, we study the accuracy of Cooperative Localization and Target Tracking (CLATT) in a team of mobile robots, and derive analytical upper bounds for the posi...
AAAI
1998
13 years 11 months ago
1998
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
JACM
2011
13 years 4 months ago
2011
We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...
ICML
2005
IEEE
14 years 10 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...