Sciweavers

251 search results - page 21 / 51
» Polynomial Time Algorithms for Three-Label Point Labeling
Sort
View
STOC
1998
ACM
129views Algorithms» more  STOC 1998»
15 years 4 months ago
Planar Map Graphs
We introduce and study a modi ed notion of planarity, in which two regions of a map are considered adjacent when they share any point of their boundaries not an edge, as standard...
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. P...
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
15 years 6 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
99
Voted
CORR
2010
Springer
109views Education» more  CORR 2010»
14 years 12 months ago
Polynomial Learning of Distribution Families
Abstract--The question of polynomial learnability of probability distributions, particularly Gaussian mixture distributions, has recently received significant attention in theoreti...
Mikhail Belkin, Kaushik Sinha
COLT
1995
Springer
15 years 3 months ago
Exactly Learning Automata with Small Cover Time
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
Dana Ron, Ronitt Rubinfeld
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
16 years 5 days ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...