Sciweavers

447 search results - page 88 / 90
» Approximation Algorithms for the Discrete Time-Cost Tradeoff...
Sort
View
ICML
2004
IEEE
14 years 8 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 7 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ICML
1996
IEEE
14 years 8 months ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 4 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
COCOA
2009
Springer
13 years 12 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya