3708 search results - page 71 / 742 » Approximating Betweenness Centrality |
96
Voted
CPM
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
89
Voted
ICRA
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
100
Voted
BIBE
2005
IEEE
15 years 6 months ago
2005
IEEE
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
92
Voted
SPIRE
2005
Springer
15 years 6 months ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
114
click to vote
ICCS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Infinite contexts and their corresponding lattices are of theoretical and practical interest since they may offer connections with and insights from other mathematical ...