Sciweavers

7 search results - page 1 / 2
» Estimating arbitrary subset sums with few probes
Sort
View
PODS
2005
ACM
151views Database» more  PODS 2005»
14 years 5 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
FCT
1991
Springer
13 years 8 months ago
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems
We report on improved practical algorithms for lattice basis reduction. We propose a practical oating point version of the L3{algorithm of Lenstra, Lenstra, Lovasz (1982). We pres...
Claus-Peter Schnorr, M. Euchner
TSP
2008
179views more  TSP 2008»
13 years 4 months ago
Estimation in Gaussian Graphical Models Using Tractable Subgraphs: A Walk-Sum Analysis
Graphical models provide a powerful formalism for statistical signal processing. Due to their sophisticated modeling capabilities, they have found applications in a variety of fie...
V. Chandrasekaran, Jason K. Johnson, Alan S. Wills...
ICPR
2008
IEEE
13 years 11 months ago
On second order operators and quadratic operators
In pattern recognition, computer vision, and image processing, many approaches are based on second order operators. Well-known examples are second order networks, the 3D structure...
Michael Felsberg
ICDM
2009
IEEE
132views Data Mining» more  ICDM 2009»
13 years 11 months ago
Bayesian Overlapping Subspace Clustering
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
Qiang Fu, Arindam Banerjee