14779 search results - page 372 / 2956 » On Ultrametric Algorithmic Information |
176
click to vote
JCB
2000
15 years 6 months ago
2000
For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic progra...
173
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
195
click to vote
VLDB
2007
ACM
16 years 27 days ago
2007
ACM
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this paper, we initiate research on the anytime b...
179
click to vote
WINE
2007
Springer
16 years 27 days ago
2007
Springer
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ï¬...
164
click to vote
ROBIO
2006
IEEE
16 years 24 days ago
2006
IEEE
Abstract— In this paper, we proposed a dynamic mobilityassisted MDS-based localization algorithms for sparse mobile sensor network. For sparse networks, the assumption of the exi...