Sciweavers

2944 search results - page 206 / 589
» Improving Bound Propagation
Sort
View
WDAG
2010
Springer
183views Algorithms» more  WDAG 2010»
15 years 4 months ago
What Is the Use of Collision Detection (in Wireless Networks)?
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
Johannes Schneider, Roger Wattenhofer
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
16 years 6 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
13 years 9 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
CVPR
2001
IEEE
16 years 8 months ago
Temporal Integration of Multiple Silhouette-Based Body-Part Hypotheses
A method for temporally integrating appearance-based body-part labelling is presented. We begin by modifying the silhouette labelling method of Ghost[4]; that system first determi...
Vivek Kwatra, Aaron F. Bobick, Amos Y. Johnson
ICPR
2000
IEEE
16 years 7 months ago
Cooperation between Level Set Techniques and Dense 3D Registration for the Segmentation of Brain Structures
This paper presents a cooperative strategy between volumetric registration and segmentation. The segmentation method is based on the level set formalism. Starting from an initial ...
C. Baillard, Pierre Hellier, Christian Barillot