1439 search results - page 95 / 288 » Fast approximation of centrality |
107
click to vote
CGF
2010
14 years 7 months ago
2010
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
CPM
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
VLDB
2000
ACM
15 years 1 months ago
2000
ACM
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
ALGORITHMICA
2005
14 years 10 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
155
click to vote
INFOCOM
2012
IEEE
13 years 12 days ago
2012
IEEE
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...