Sciweavers

272 search results - page 39 / 55
» Minimal Function Graphs are not Instrumented
Sort
View
DAC
1995
ACM
14 years 1 months ago
Register Allocation and Binding for Low Power
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
Jui-Ming Chang, Massoud Pedram
ICASSP
2010
IEEE
13 years 10 months ago
Graph-based regularization for spherical signal interpolation
This paper addresses the problem of the interpolation of 2-d spherical signals from non-uniformly sampled and noisy data. We propose a graph-based regularization algorithm to impr...
Tamara Tosic, Tamara Frossard
AUTOMATICA
2006
122views more  AUTOMATICA 2006»
13 years 10 months ago
Gibbs sampler-based coordination of autonomous swarms
In this paper a novel, Gibbs sampler-based algorithm is proposed for coordination of autonomous swarms. The swarm is modeled as a Markov random field (MRF) on a graph with a time-...
Wei Xi, Xiaobo Tan, John S. Baras
FOCS
2004
IEEE
14 years 1 months ago
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
Lisa Fleischer, Kamal Jain, Mohammad Mahdian
COCOA
2008
Springer
13 years 11 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner