526 search results - page 41 / 106 » Increments of Random Partitions |
ESA
2004
Springer
14 years 1 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
GRAPHICSINTERFACE
2003
13 years 10 months ago
2003
We present an out-of-core mesh decimation algorithm that is able to handle input and output meshes of arbitrary size. The algorithm reads the input from a data stream in a single ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We consider a network of sensors deployed to sense a spatio-temporal field and infer parameters of interest about the field. We are interested in the case where each sensor's...
PAKDD
2007
ACM
14 years 2 months ago
2007
ACM
In this paper, we study the privacy-preserving decision tree building problem on vertically partitioned data. We made two contributions. First, we propose a novel hybrid approach, ...
DCC
2004
IEEE
14 years 8 months ago
2004
IEEE
In this paper, we build multi-resolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for n-dimensional random vectors, dithering followe...