Sciweavers

866 search results - page 91 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
NCA
2007
IEEE
14 years 3 months ago
On the Evaluation of Shortest Journeys in Dynamic Networks
The assessment of routing protocols for wireless networks is a difficult task, because of the networks’ highly dynamic behavior and the absence of benchmarks. However, some of ...
Afonso Ferreira, Alfredo Goldman, Julian Monteiro
SC
2003
ACM
14 years 2 months ago
Traffic-based Load Balance for Scalable Network Emulation
Load balance is critical to achieving scalability for large network emulation studies, which are of compelling interest for emerging Grid, Peer to Peer, and other distributed appl...
Xin Liu, Andrew A. Chien
ISCAPDCS
2007
13 years 10 months ago
A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
Omar Kermia, Yves Sorel
TWC
2008
80views more  TWC 2008»
13 years 9 months ago
Robust connectivity-aware energy-efficient routing for wireless sensor networks
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
Charles Pandana, K. J. Ray Liu
CVPR
2011
IEEE
13 years 5 months ago
Biased Normalized Cuts
We present a modification of “Normalized Cuts” to incorporate priors which can be used for constrained image segmentation. Compared to previous generalizations of “Normaliz...
Subhransu Maji, Nisheeth Vishnoi, Jitendra Malik