Sciweavers

1991 search results - page 28 / 399
» Small Models of Large Machines
Sort
View
68
Voted
WWW
2009
ACM
15 years 10 months ago
Social search in "Small-World" experiments
The "algorithmic small-world hypothesis" states that not only are pairs of individuals in a large social network connected by short paths, but that ordinary individuals ...
Sharad Goel, Roby Muhamad, Duncan J. Watts
ICML
2005
IEEE
15 years 10 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
MLG
2007
Springer
15 years 3 months ago
Inferring Vertex Properties from Topology in Large Networks
: Network topology not only tells about tightly-connected “communities,” but also gives cues on more subtle properties of the vertices. We introduce a simple probabilistic late...
Janne Sinkkonen, Janne Aukia, Samuel Kaski
90
Voted
STACS
2007
Springer
15 years 3 months ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler
NLP
2000
15 years 1 months ago
Learning Rules for Large-Vocabulary Word Sense Disambiguation: A Comparison of Various Classifiers
In this article we compare the performance of various machine learning algorithms on the task of constructing word-sense disambiguation rules from data. The distinguishing characte...
Georgios Paliouras, Vangelis Karkaletsis, Ion Andr...