Sciweavers

142 search results - page 22 / 29
» Approximate maximum weight branchings
Sort
View
77
Voted
SIGECOM
2010
ACM
201views ECommerce» more  SIGECOM 2010»
15 years 2 months ago
Truthful assignment without money
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
Shaddin Dughmi, Arpita Ghosh
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
14 years 11 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
VLSID
2002
IEEE
127views VLSI» more  VLSID 2002»
15 years 9 months ago
Switching Activity Estimation of Large Circuits using Multiple Bayesian Networks
Switching activity estimation is a crucial step in estimating dynamic power consumption in CMOS circuits. In [1], we proposed a new switching probability model based on Bayesian N...
Sanjukta Bhanja, N. Ranganathan
ICASSP
2010
IEEE
14 years 9 months ago
Utilizing principal singular vectors for two-dimensional single frequency estimation
In this paper, frequency estimation of a twodimensional (2D) cisoid in the presence of additive white Gaussian noise is addressed. By utilizing the rank-one property of the 2D noi...
H. C. So, Frankie K. W. Chan, C. F. Chan, W. H. La...
PAMI
2006
168views more  PAMI 2006»
14 years 9 months ago
Graphical Models and Point Pattern Matching
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
Tibério S. Caetano, Terry Caelli, Dale Schu...