Sciweavers

365 search results - page 45 / 73
» Maintaining the Ranch topology
Sort
View
COMPGEOM
2010
ACM
14 years 1 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...
ICCAD
1999
IEEE
66views Hardware» more  ICCAD 1999»
14 years 9 days ago
Timing-safe false path removal for combinational modules
A delay abstraction of a combinational module is a compact representation of the delay information of the module, which carries effective pin-to-pin delay for each primary-input/pr...
Yuji Kukimoto, Robert K. Brayton
HIPC
2000
Springer
13 years 11 months ago
A Weight Based Distributed Clustering Algorithm for Mobile ad hoc Networks
In this paper, we propose a distributed clustering algorithm for a multi-hop packet radio network. These types of networks, also known as ad hoc networks, are dynamic in nature due...
Mainak Chatterjee, Sajal K. Das, Damla Turgut
CGF
2005
311views more  CGF 2005»
13 years 8 months ago
Cubical Marching Squares: Adaptive Feature Preserving Surface Extraction from Volume Data
In this paper, we present a new method for surface extraction from volume data which preserves sharp features, maintains consistent topology and generates surface adaptively witho...
Chien-Chang Ho, Fu-Che Wu, Bing-Yu Chen, Yung-Yu C...
NETWORK
2006
218views more  NETWORK 2006»
13 years 8 months ago
Quality of service for packet telephony over mobile ad hoc networks
IP telephony over mobile ad hoc networks is a topic of emerging interest in the research arena as one of the paths toward the fixed-mobile convergence in telecommunications networ...
Paolo Giacomazzi, Luigi Musumeci, Giuseppe Caizzon...