CLUSTER
2002
IEEE
13 years 9 months ago
2002
IEEE
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
CLUSTER
2002
IEEE
13 years 9 months ago
2002
IEEE
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
COMCOM
2000
13 years 9 months ago
2000
The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum...
CGF
2002
13 years 9 months ago
2002
A way to create effective stylized line drawings is to draw strokes that start and stop at visible portions along the silhouette of an object to be portrayed. In computer graphics...
CGF
2002
13 years 9 months ago
2002
This paper presents a robust watermarking algorithm with informed detection for 3D polygonal meshes. The algorithm is based on our previous algorithm [22] that employs mesh-spectr...
CG
2002
Springer
13 years 9 months ago
2002
Springer
Recently, we proposed a new isosurface extraction algorithm that extracts portions of the isosurface in a viewdependent manner by ray casting and propagation. The algorithm casts ...
CG
2002
Springer
13 years 9 months ago
2002
Springer
Abstract. The paper introduces a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search, which performs at the first level a depth-first Proof-number and D...
CCR
2002
13 years 9 months ago
2002
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
CLUSTER
2000
IEEE
13 years 9 months ago
2000
IEEE
Ring networks are enjoying renewed interest as Storage Area Networks (SANs), i.e., networks for interconnecting storage devices (e.g., disk, disk arrays and tape drives) and stora...
CAI
2002
Springer
13 years 9 months ago
2002
Springer
In a localized routing algorithm, node A currently holding the message forwards it based on the location of itself, its neighboring nodes and destination. We propose to use depth ...