16666 search results - page 2626 / 3334 » Descriptive and Computational Complexity |
244
click to vote
MOBIHOC
2010
ACM
15 years 5 months ago
2010
ACM
In this paper, we address the problem of preserving generated data in a sensor network in case of node failures. We focus on the type of node failures that have explicit spatial s...
220
click to vote
MOBIHOC
2010
ACM
15 years 5 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
195
click to vote
NAACL
2010
15 years 5 months ago
2010
Knowledge extraction from online repositories such as PubMed holds the promise of dramatically speeding up biomedical research and drug design. After initially focusing on recogni...
260
click to vote
NAACL
2010
15 years 5 months ago
2010
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
189
click to vote
PDPTA
2010
15 years 5 months ago
2010
The problem of programmability on modern heterogeneous multicore and future manycore embedded platforms is still not solved satisfactorily: although many existing but incompatible ...