1046 search results - page 74 / 210 » Approximation Algorithms for Domination Search |
107
click to vote
LATIN
1998
Springer
15 years 4 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
125
click to vote
ALGORITHMICA
2000
15 years 10 days ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
123
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
WINE
2009
Springer
15 years 7 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
97
Voted
IICS
2003
Springer
15 years 5 months ago
2003
Springer
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking al...