614 search results - page 53 / 123 » Local Computation: Lower and Upper Bounds |
ICCAD
2006
IEEE
15 years 6 months ago
2006
IEEE
Battery-powered wireless sensors are severely constrained by the amount of the available energy. A method for computing the energy budget per sensing task can be a valuable design...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
SIGECOM
2004
ACM
15 years 3 months ago
2004
ACM
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...
STACS
2000
Springer
15 years 1 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
106
click to vote
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
—Localizability of network or node is an important subproblem in sensor localization. While rigidity theory plays an important role in identifying several localizability conditio...