Sciweavers

5153 search results - page 861 / 1031
» Introduction to Randomized Algorithms
Sort
View
CIKM
2009
Springer
15 years 9 months ago
Automatic link detection: a sequence labeling approach
The popularity of Wikipedia and other online knowledge bases has recently produced an interest in the machine learning community for the problem of automatic linking. Automatic hy...
James J. Gardner, Li Xiong
CIKM
2009
Springer
15 years 9 months ago
Automatic retrieval of similar content using search engine query interface
We consider the coverage testing problem where we are given a document and a corpus with a limited query interface and asked to find if the corpus contains a near-duplicate of th...
Ali Dasdan, Paolo D'Alberto, Santanu Kolay, Chris ...
COCO
2009
Springer
98views Algorithms» more  COCO 2009»
15 years 9 months ago
Extractors for Varieties
We study the task of randomness extraction from sources which are distributed uniformly on an unknown algebraic variety. In other words, we are interested in constructing a functi...
Zeev Dvir
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
15 years 9 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
Joshua Brody
CPM
2009
Springer
127views Combinatorics» more  CPM 2009»
15 years 9 months ago
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...