2040 search results - page 229 / 408 » Approximate Expectation Maximization |
135
Voted
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
115
Voted
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
The recurring real-time task model was recently proposed as a model for real-time processes that contain code with conditional branches. In this paper, we present a necessary and ...
158
Voted
CIAC
1994
Springer
15 years 7 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
163
Voted
ALGOSENSORS
2007
Springer
15 years 7 months ago
2007
Springer
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
119
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...