3341 search results - page 275 / 669 » On Bounded Queries and Approximation |
174
click to vote
MCSS
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we consider systems which are globally completly observable and output-to-state stable. The former property guarantees the existence of coordinates such that the dyna...
199
click to vote
MOC
2010
15 years 1 months ago
2010
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the...
170
Voted
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
168
click to vote
CIA
2006
Springer
15 years 10 months ago
2006
Springer
Intelligent coordination in complex multi-agent environments requires sophisticated mechanisms for suboptimal task decomposition and efficient resource allocation provided by the t...
182
click to vote
TOC
2010
15 years 1 months ago
2010
: We consider the Submodular Welfare Problem where we have m items and n players with given utility functions wi : 2[m] R+. The utility functions are assumed to be monotone and su...