6315 search results - page 224 / 1263 » Approximating Solution Structure |
139
click to vote
ENTCS
2007
15 years 6 months ago
2007
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
182
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
167
click to vote
PODC
2005
ACM
16 years 4 days ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
153
click to vote
GIS
1999
ACM
15 years 11 months ago
1999
ACM
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
184
click to vote
NIPS
1998
15 years 8 months ago
1998
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...