34 search results - page 4 / 7 » The Computational Hardness of Estimating Edit Distance |
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
IPSN
2011
Springer
12 years 11 months ago
2011
Springer
Having access to accurate position information is a key requirement for many wireless sensor network applications. We present the design, implementation and evaluation of SpiderBa...
FSTTCS
2003
Springer
14 years 20 days ago
2003
Springer
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
3DPVT
2006
IEEE
14 years 1 months ago
2006
IEEE
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
MOBISYS
2004
ACM
14 years 7 months ago
2004
ACM
We study the problem of tracking a moving device under two indoor location architectures: an active mobile architecture and a passive mobile architecture. In the former, the infra...