Sciweavers

691 search results - page 89 / 139
» Non-negative graph embedding
Sort
View
IPPS
2006
IEEE
14 years 2 months ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...
IEEEHPCS
2010
13 years 6 months ago
Reducing memory requirements of stream programs by graph transformations
Stream languages explicitly describe fork-join parallelism and pipelines, offering a powerful programming model for many-core Multi-Processor Systems on Chip (MPSoC). In an embedd...
Pablo de Oliveira Castro, Stéphane Louise, ...
USS
2010
13 years 6 months ago
BotGrep: Finding P2P Bots with Structured Graph Analysis
A key feature that distinguishes modern botnets from earlier counterparts is their increasing use of structured overlay topologies. This lets them carry out sophisticated coordina...
Shishir Nagaraja, Prateek Mittal, Chi-Yao Hong, Ma...
WADS
2001
Springer
126views Algorithms» more  WADS 2001»
14 years 15 days ago
On External-Memory Planar Depth First Search
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
STOC
2005
ACM
115views Algorithms» more  STOC 2005»
14 years 8 months ago
Lower-stretch spanning trees
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
Michael Elkin, Yuval Emek, Daniel A. Spielman, Sha...