1279 search results - page 229 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
124
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
102
click to vote
PODS
2010
ACM
15 years 7 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
143
Voted
ECCV
2002
Springer
16 years 4 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
102
click to vote
DCC
2004
IEEE
16 years 2 months ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
119
Voted
KDD
2007
ACM
16 years 2 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...