Sciweavers

3204 search results - page 137 / 641
» The Alcuin Number of a Graph
Sort
View
ISAAC
2004
Springer
94views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Error Compensation in Leaf Root Problems
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
CVPR
1999
IEEE
14 years 16 days ago
Detecting and Tracking Moving Objects for Video Surveillance
We address the problem of detection and tracking of moving objects in a video stream obtained from a moving airborne platform. The proposed method relies on a graph representation...
Isaac Cohen, Gérard G. Medioni
PC
2000
93views Management» more  PC 2000»
13 years 8 months ago
Scheduling outtrees of height one in the LogP model
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
Jacques Verriet
ICASSP
2010
IEEE
13 years 6 months ago
Unidirectional graph-based wavelet transforms for efficient data gathering in sensor networks
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
Sunil K. Narang, Godwin Shen, Antonio Ortega
RSP
2000
IEEE
156views Control Systems» more  RSP 2000»
14 years 18 days ago
Quasi-Static Scheduling of Reconfigurable Dataflow Graphs for DSP Systems
Dataflow programming has proven to be popular for representing applications in rapid prototyping tools for digital signal processing (DSP); however, existing dataflow design tools...
Bishnupriya Bhattacharya, Shuvra S. Bhattacharyya