Sciweavers

124 search results - page 17 / 25
» The Path Length of Binary Trees
Sort
View
WWW
2008
ACM
14 years 9 months ago
Statistical analysis of the social network and discussion threads in slashdot
We analyze the social network emerging from the user comment activity on the website Slashdot. The network presents common features of traditional social networks such as a giant ...
Andreas Kaltenbrunner, Vicenç Gómez,...
IJPP
2008
74views more  IJPP 2008»
13 years 9 months ago
Bandwidth Efficient All-to-All Broadcast on Switched Clusters
We develop an all-to-all broadcast scheme that achieves maximum bandwidth efficiency for clusters with tree topologies. Using our scheme for clusters with cut-through switches, an...
Ahmad Faraj, Pitch Patarasuk, Xin Yuan
ICC
2009
IEEE
159views Communications» more  ICC 2009»
14 years 3 months ago
An Enhanced Multiple-Feedback Algorithm for RFID MAC Protocols
Abstract— This paper introduces two new tree-based anticollision schemes using multiple feedback symbols for uplink tag random access of emerging radio frequency identification (...
You-Chang Ko, Sumit Roy, Choong-Ho Cho, Hyong-Woo ...
VISUALIZATION
1996
IEEE
14 years 1 months ago
Real-Time Incremental Visualization of Dynamic Ultrasound Volumes Using Parallel BSP Trees
We present a method for producing real-time volume visualizations of continuously captured, arbitrarily-oriented 2D arrays (slices) of data. Our system constructs a 3D representat...
William F. Garrett, Henry Fuchs, Mary C. Whitton, ...
IJFCS
1998
67views more  IJFCS 1998»
13 years 8 months ago
Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni