2403 search results - page 75 / 481 » Optimal Randomized RANSAC |
107
click to vote
PAMI
1998
15 years 2 months ago
1998
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
124
Voted
CORR
2010
Springer
15 years 1 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...
116
click to vote
FOCS
2010
IEEE
15 years 1 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,...
119
click to vote
TIT
2010
14 years 9 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...
129
click to vote
IPCO
2007
15 years 4 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...