Sciweavers

STOC
2010
ACM
181views Algorithms» more  STOC 2010»
13 years 10 months ago
Load balancing and orientability thresholds for random hypergraphs
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
Pu Gao, Nicholas C. Wormald
SPAA
2010
ACM
13 years 10 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
SPAA
2010
ACM
13 years 10 months ago
Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures
We present a scheduling algorithm of stream programs for multi-core architectures called team scheduling. Compared to previous multi-core stream scheduling algorithms, team schedu...
JongSoo Park, William J. Dally
SPAA
2010
ACM
13 years 10 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
SMA
2010
ACM
223views Solid Modeling» more  SMA 2010»
13 years 10 months ago
Hyperbolic centroidal Voronoi tessellation
The centroidal Voronoi tessellation (CVT) has found versatile applications in geometric modeling, computer graphics, and visualization. In this paper, we extend the concept of the...
Guodong Rong, Miao Jin, Xiaohu Guo
SIGCOMM
2010
ACM
13 years 10 months ago
DONAR: decentralized server selection for cloud services
Geo-replicated services need an effective way to direct client requests to a particular location, based on performance, load, and cost. This paper presents DONAR, a distributed sy...
Patrick Wendell, Joe Wenjie Jiang, Michael J. Free...
SIGCOMM
2010
ACM
13 years 10 months ago
EffiCuts: optimizing packet classification for memory and throughput
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...
Balajee Vamanan, Gwendolyn Voskuilen, T. N. Vijayk...
DSD
2010
IEEE
140views Hardware» more  DSD 2010»
13 years 10 months ago
Optimization of Area and Delay at Gate-Level in Multiple Constant Multiplications
—Although many efficient high-level algorithms have been proposed for the realization of Multiple Constant Multiplications (MCM) using the fewest number of addition and subtract...
Levent Aksoy, Eduardo Costa, Paulo F. Flores, Jos&...
MOBIDE
2010
ACM
13 years 10 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...
MM
2010
ACM
203views Multimedia» more  MM 2010»
13 years 10 months ago
Processing web-scale multimedia data
The Internet brings us access to multimedia databases with billions of data instances. The massive amount of data available to researchers and application developers brings both o...
Malcolm Slaney, Edward Y. Chang