Sciweavers

2111 search results - page 245 / 423
» Understanding the Yarowsky Algorithm
Sort
View
AAAI
1990
15 years 7 months ago
Terminological Cycles in KL-ONE-based Knowledge Representation Languages
Cyclic definitions are often prohibited in terminological knowledge representation languages because, from a theoretical point of view, their semantics is not clear and, from a pr...
Franz Baader
ESA
2010
Springer
178views Algorithms» more  ESA 2010»
15 years 7 months ago
Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this ...
Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden
EUROPAR
2010
Springer
15 years 7 months ago
Ants in Parking Lots
Ants provide an attractive metaphor for robots that "cooperate" in performing complex tasks. What, however, are the algorithmic consequences of following this metaphor? ...
Arnold L. Rosenberg
ICML
2010
IEEE
15 years 7 months ago
Local Minima Embedding
Dimensionality reduction is a commonly used step in many algorithms for visualization, classification, clustering and modeling. Most dimensionality reduction algorithms find a low...
Minyoung Kim, Fernando De la Torre
ICAISC
2010
Springer
15 years 6 months ago
Pruning Classification Rules with Reference Vector Selection Methods
Attempts to extract logical rules from data often lead to large sets of classification rules that need to be pruned. Training two classifiers, the C4.5 decision tree and the Non-Ne...
Karol Grudzinski, Marek Grochowski, Wlodzislaw Duc...