Sciweavers

12519 search results - page 26 / 2504
» Approximation Problems Categories
Sort
View
WWW
2005
ACM
16 years 13 days ago
On the feasibility of low-rank approximation for personalized PageRank
Personalized PageRank expresses backlink-based page quality around user-selected pages in a similar way to PageRank over the entire Web. Algorithms for computing personalized Page...
András A. Benczúr, Károly Csa...
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 4 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
NIPS
2004
15 years 1 months ago
Class-size Independent Generalization Analsysis of Some Discriminative Multi-Category Classification
We consider the problem of deriving class-size independent generalization bounds for some regularized discriminative multi-category classification methods. In particular, we obtai...
Tong Zhang
ACL
1996
15 years 1 months ago
Unsupervised Learning of Word-Category Guessing Rules
Words unknown to the lexicon present a substantial problem to part-of-speech tagging. In this paper we present a technique for fully unsupervised statistical acquisition of rules ...
Andrei Mikheev
CCCG
2009
15 years 26 days ago
Data Structures for Range Aggregation by Categories
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles...
Saladi Rahul, Prosenjit Gupta, K. S. Rajan