3422 search results - page 121 / 685 » Random Subset Optimization |
158
click to vote
ECCV
1994
Springer
15 years 8 months ago
1994
Springer
A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is dened as the maximum a posteriori (MAP) probability estimate...
146
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
This paper discusses the topic of dimensionality reduction for k-means clustering. We prove that any set of n points in d dimensions (rows in a matrix A ∈ Rn×d ) can be project...
130
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...
139
click to vote
TIT
2010
14 years 11 months ago
2010
A variable-to-fixed length encoder partitions the source string into variable-length phrases that belong to a given and fixed dictionary. Tunstall, and independently Khodak, desig...
138
Voted
ICIP
2005
IEEE
16 years 6 months ago
2005
IEEE
We describe an enhanced method for the selection of optimal sensor actions in a probabilistic state estimation framework. We apply this to the selection of optimal focal lengths f...