Sciweavers

650 search results - page 101 / 130
» Positive graphs
Sort
View
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
13 years 11 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
COLT
1989
Springer
14 years 1 months ago
Learning in the Presence of Inaccurate Information
The present paper considers the effects of introducing inaccuracies in a learner’s environment in Gold’s learning model of identification in the limit. Three kinds of inaccu...
Mark A. Fulk, Sanjay Jain
ICCV
2011
IEEE
12 years 10 months ago
Discriminative Learning of Relaxed Hierarchy for Large-scale Visual Recognition
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...
Tianshi Gao, Daphne Koller
EMNLP
2010
13 years 7 months ago
A Semi-Supervised Method to Learn and Construct Taxonomies Using the Web
Although many algorithms have been developed to harvest lexical resources, few organize the mined terms into taxonomies. We propose (1) a semi-supervised algorithm that uses a roo...
Zornitsa Kozareva, Eduard H. Hovy
COLT
2008
Springer
13 years 11 months ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin