Sciweavers

4047 search results - page 585 / 810
» The Discrete Basis Problem
Sort
View
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 5 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
RECOMB
2003
Springer
16 years 4 months ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson
146
Voted
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
16 years 4 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
ICSE
2007
IEEE-ACM
16 years 4 months ago
Exception-Chain Analysis: Revealing Exception Handling Architecture in Java Server Applications
Although it is common in large Java programs to rethrow exceptions, existing exception-flow analyses find only single exceptionflow links, thus are unable to identify multiple-lin...
Chen Fu, Barbara G. Ryder

Publication
338views
16 years 2 months ago
Shape from Shading with a Generalized Reflectance Map Model
Most conventional SFS (shape from shading) algorithms have been developed under three basic assumptions on surface properties and imaging geometry to simplify the problem, namely, ...
Kyoung Mu Lee (Seoul National University), C.-C. J...