Sciweavers

1656 search results - page 67 / 332
» Labeling Schemes with Queries
Sort
View
ALGORITHMICA
1998
94views more  ALGORITHMICA 1998»
13 years 8 months ago
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
Philip N. Klein, Sairam Subramanian
IAT
2010
IEEE
13 years 6 months ago
Concept Learning Games: The Game of Query and Response
Abstract--This article deals with the issue of concept learning and tries to have a game theoretic view over the process of cooperative concept learning among agents in a multi-age...
Nima Mirbakhsh, Arman Didandeh, Mohsen Afsharchi
ICML
2001
IEEE
14 years 9 months ago
Toward Optimal Active Learning through Sampling Estimation of Error Reduction
This paper presents an active learning method that directly optimizes expected future error. This is in contrast to many other popular techniques that instead aim to reduce versio...
Nicholas Roy, Andrew McCallum
NIPS
2004
13 years 10 months ago
On Semi-Supervised Classification
A graph-based prior is proposed for parametric semi-supervised classification. The prior utilizes both labelled and unlabelled data; it also integrates features from multiple view...
Balaji Krishnapuram, David Williams, Ya Xue, Alexa...
AAAI
1997
13 years 10 months ago
Active Learning with Committees for Text Categorization
In many real-world domains, supervised learning requires a large number of training examples. In this paper, we describe an active learning method that uses a committee of learner...
Ray Liere, Prasad Tadepalli