3991 search results - page 363 / 799 » Bounding homogeneous models |
172
click to vote
KDD
2004
ACM
16 years 8 months ago
2004
ACM
We propose and test an objective criterion for evaluation of clustering performance: How well does a clustering algorithm run on unlabeled data aid a classification algorithm? The...
185
click to vote
STOC
2005
ACM
16 years 8 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
175
click to vote
ICIAP
2003
ACM
16 years 7 months ago
2003
ACM
This paper deals with the problem of error estimation in 3D reconstruction. It shows how interval analysis can be used in this way for 3D vision applications. The description of a...
196
click to vote
FOCS
2009
IEEE
16 years 2 months ago
2009
IEEE
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...
215
click to vote
INFOCOM
2009
IEEE
16 years 2 months ago
2009
IEEE
—In the last few years, long-distance WiFi networks have been used to provide Internet connectivity in rural areas. The strong requirement to support real-time applications in th...