395 search results - page 39 / 79 » Positive Versions of Polynomial Time |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
AIPR
2003
IEEE
15 years 3 months ago
2003
IEEE
In the research reported in this paper, we propose to overcome the unavailability of Global Positioning System (GPS) using combined information obtained from a scanning LADAR rang...
DCOSS
2009
Springer
15 years 4 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
COMPLEX
2009
Springer
15 years 4 months ago
2009
Springer
We introduce transformations from time series data to the domain of complex networks which allow us to characterise the dynamics underlying the time series in terms of topological ...
FSTTCS
2009
Springer
15 years 2 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...