Sciweavers

1161 search results - page 104 / 233
» Approximation schemes for clustering problems
Sort
View
110
Voted
IPPS
2000
IEEE
15 years 8 months ago
Reduction Optimization in Heterogeneous Cluster Environments
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...
Pangfeng Liu, Da-Wei Wang
BMCBI
2006
117views more  BMCBI 2006»
15 years 3 months ago
The Cluster Variation Method for Efficient Linkage Analysis on Extended Pedigrees
Background: Computing exact multipoint LOD scores for extended pedigrees rapidly becomes infeasible as the number of markers and untyped individuals increase. When markers are exc...
Cornelis A. Albers, Martijn A. R. Leisink, Hilbert...
CISS
2007
IEEE
15 years 9 months ago
Analog Coding for Delay-Limited Applications
— In this paper, we consider the problem of sending an analog source over an additive white Gaussian noise channel. The traditional analog coding schemes suffer from the threshol...
Mahmoud Taherzadeh, Amir K. Khandani
136
Voted
SCALESPACE
2009
Springer
15 years 10 months ago
A Non-local Approach to Shape from Ambient Shading
We study the mathematical and numerical aspects of the estimation of the 3-D shape of a Lambertian scene seen under diffuse illumination. This problem is known as “shape from amb...
Emmanuel Prados, Nitin Jindal, Stefano Soatto
168
Voted
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 11 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson