1941 search results - page 306 / 389 » On the Hardness of Approximate Reasoning |
190
click to vote
IPSN
2007
Springer
16 years 10 days ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
166
click to vote
STACS
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
170
click to vote
CIBCB
2006
IEEE
16 years 8 days ago
2006
IEEE
— Successful biological image analysis usually requires satisfactory segmentations to identify regions of interest as an intermediate step. Here we present a novel graphical mode...
217
click to vote
ICRA
2006
IEEE
16 years 7 days ago
2006
IEEE
— Recently, Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter i...
168
click to vote
SPAA
2006
ACM
16 years 4 days ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...