Sciweavers

3250 search results - page 271 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ESOP
2010
Springer
16 years 1 months ago
Amortized Resource Analysis with Polynomial Potential
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs....
Jan Hoffmann 0002, Martin Hofmann
169
Voted
CORR
2008
Springer
82views Education» more  CORR 2008»
15 years 6 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
16 years 1 months ago
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. In an already classi...
Christoph Dürr, Flavio Guiñez, Mart&ia...
UAI
2004
15 years 8 months ago
On Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
Bozhena Bidyuk, Rina Dechter
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 6 months ago
Gaussian Belief Propagation Based Multiuser Detection
In this work, we present a novel construction for solving the linear multiuser detection problem using the Gaussian Belief Propagation algorithm. Our algorithm yields an efficient,...
Danny Bickson, Danny Dolev, Ori Shental, Paul H. S...