Sciweavers

1089 search results - page 85 / 218
» Bounds on generalized Frobenius numbers
Sort
View
CORR
2008
Springer
124views Education» more  CORR 2008»
13 years 9 months ago
Scheduling Kalman Filters in Continuous Time
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
Jerome Le Ny, Eric Feron, Munther A. Dahleh
COMGEO
2007
ACM
13 years 9 months ago
On incremental rendering of silhouette maps of a polyhedral scene
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...
Alon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt,...
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
14 years 1 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
TSP
2011
106views more  TSP 2011»
13 years 4 months ago
Distributed Estimation and Coding: A Sequential Framework Based on a Side-Informed Decomposition
Abstract—We propose a sequential framework for the distributed multiple-sensor estimation and coding problem that decomposes the problem into a series of side-informed source cod...
Chao Yu, Gaurav Sharma
SOFSEM
2007
Springer
14 years 3 months ago
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...
Yefim Dinitz, Shay Solomon