350 search results - page 3 / 70 » Hardness Results for Homology Localization |
IPSN
2005
Springer
13 years 11 months ago
2005
Springer
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
IJRR
2006
13 years 5 months ago
2006
ABSTRACT. We introduce tools from computational homology to verify coverage in an idealized sensor network. Our methods are unique in that, while they are coordinate-free and assum...
BMCBI
2008
13 years 5 months ago
2008
Background: Sequence searches are routinely employed to detect and annotate related proteins. However, a rapid growth of databases necessitates a frequent repetition of sequence s...
GD
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor r...
APAL
2010
13 years 5 months ago
2010
In [1] it was developed o-minimal homotopy for the definable category, proving o-minimal versions of the Hurewicz theorems and the Whitehead theorem. Here, we also extend these res...