2740 search results - page 184 / 548 » Approximating Component Selection |
135
click to vote
NIPS
1994
15 years 4 months ago
1994
For many types of machine learning algorithms, one can compute the statistically optimal" way to select training data. In this paper, we review how optimal data selection tec...
123
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
125
click to vote
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
We present an approach to jointly solve the segmentation and recognition problem using a multiple segmentation framework. We formulate the problem as segment selection from a pool...
106
Voted
ICPR
2006
IEEE
16 years 4 months ago
2006
IEEE
The visual hull is widely used to produce three dimensional models from multiple views, due to the reliability of the resulting surface. This paper presents a novel method for eff...
104
click to vote
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...