Sciweavers

1429 search results - page 129 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
SPAA
2004
ACM
14 years 2 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt
AIPR
2005
IEEE
14 years 2 months ago
Discretization Error Based Mesh Generation for Diffuse Optical Tomography
In this paper, we analyze the perturbation in the reconstructed optical absorption images, resulting from the discretization of the forward and inverse problems. We show that the ...
Murat Guven, Birsen Yazici, Kiwoon Kwon, Eldar Gil...
ICIP
2009
IEEE
14 years 10 months ago
Principal Moments For Efficient Representation Of 2d Shape
The analytic signature is a recently proposed 2D shape representation scheme. It is tailored to the representation of shapes described by arbitrary sets of unlabeled points, or la...
JMLR
2010
118views more  JMLR 2010»
13 years 3 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
GLOBECOM
2009
IEEE
14 years 3 months ago
A Suboptimal Network Utility Maximization Approach for Scalable Multimedia Applications
—Wired and wireless data networks have witnessed an explosive growth of inelastic traffics such as real-time or media streaming applications. Recently, applications relying on l...
Mohammad Sadegh Talebi, Ahmad Khonsari, Mohammad H...