Sciweavers

13621 search results - page 357 / 2725
» Computability and Complexity in Self-assembly
Sort
View
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
15 years 10 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
COMPGEOM
2005
ACM
15 years 8 months ago
The Visibility-Voronoi Complex and Its Applications
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
Ron Wein, Jur P. van den Berg, Dan Halperin
CORR
2010
Springer
111views Education» more  CORR 2010»
15 years 6 months ago
Improved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Elias P. Tsigaridas
IVC
2002
143views more  IVC 2002»
15 years 6 months ago
Towards the automatic analysis of complex human body motions
The classification of human body motion is an integral component for the automatic interpretation of video sequences. In a first part we present an effective approach that uses mi...
Jens Rittscher, Andrew Blake, Stephen J. Roberts
ICC
2008
IEEE
145views Communications» more  ICC 2008»
16 years 1 months ago
A Low-Complexity Synchronization Design for MB-OFDM Ultra-Wideband Systems
In this paper, we investigate the low-complexity synchronization design for multi-band orthogonalfrequency-division-multiplexing (MB-OFDM) ultra-wideband (UWB) systems. We propose...
Zhenzhen Ye, Chunjie Duan, Philip V. Orlik, Jinyun...