Sciweavers

1576 search results - page 152 / 316
» Streaming Algorithms for Independent Sets
Sort
View
STOC
2003
ACM
137views Algorithms» more  STOC 2003»
16 years 4 months ago
Near-optimal network design with selfish agents
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
Elliot Anshelevich, Anirban Dasgupta, Éva T...
INEX
2005
Springer
15 years 10 months ago
A Flexible Structured-Based Representation for XML Document Mining
This paper reports on the INRIA group’s approach to XML mining while participating in the INEX XML Mining track 2005. We use a flexible representation of XML documents that allo...
Anne-Marie Vercoustre, Mounir Fegas, Saba Gul, Yve...
BMCBI
2005
108views more  BMCBI 2005»
15 years 4 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
16 years 4 months ago
Approximate clustering via core-sets
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
AINA
2007
IEEE
15 years 10 months ago
Extracting Significant Phrases from Text
Prospective readers can quickly determine whether a document is relevant to their information need if the significant phrases (or keyphrases) in this document are provided. Althou...
Yuan J. Lui, Richard Brent, Ani Calinescu