Sciweavers

3637 search results - page 696 / 728
» On Dynamic Bit-Probe Complexity
Sort
View
COMPGEOM
2010
ACM
14 years 2 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
HICSS
2002
IEEE
148views Biometrics» more  HICSS 2002»
14 years 1 months ago
Barriers to a Wide-Area Trusted Network Early Warning System for Electric Power Disturbances
It is apparent that perturbations of the North American electric power grid follow the patterns and characteristics of Self Organized Critical (SOC) systems. Published studies sho...
Paul W. Oman, Jeff Roberts
HICSS
2002
IEEE
78views Biometrics» more  HICSS 2002»
14 years 1 months ago
What Is Effective GSS Facilitation? A Qualitative Inquiry into Participants' Perceptions
Facilitation in GSS meetings is considered among the most important critical success factors for effective GSS application. A considerable amount of research on GSS facilitation h...
Gert-Jan de Vreede, Jessica Boonstra, Fred Niederm...
ICNP
2002
IEEE
14 years 1 months ago
Using Adaptive Rate Estimation to Provide Enhanced and Robust Transport over Heterogeneous Networks
The rapid advancement in wireless communication technology has spurred significant interest in the design and development of enhanced TCP protocols. Among them, TCP Westwood (TCPW...
Ren Wang, Massimo Valla, M. Y. Sanadidi, Mario Ger...
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
14 years 1 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick