Sciweavers

1941 search results - page 94 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
SC
2009
ACM
15 years 4 months ago
Kepler + Hadoop: a general architecture facilitating data-intensive applications in scientific workflow systems
MapReduce provides a parallel and scalable programming model for data-intensive business and scientific applications. MapReduce and its de facto open source project, called Hadoop...
Jianwu Wang, Daniel Crawl, Ilkay Altintas
JDA
2007
83views more  JDA 2007»
14 years 9 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes
CASES
2008
ACM
14 years 12 months ago
Reducing pressure in bounded DBT code caches
Dynamic binary translators (DBT) have recently attracted much attention for embedded systems. The effective implementation of DBT in these systems is challenging due to tight cons...
José Baiocchi, Bruce R. Childers, Jack W. D...
GD
2004
Springer
15 years 3 months ago
Drawing Power Law Graphs
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
Reid Andersen, Fan R. K. Chung, Lincoln Lu
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
14 years 11 months ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...