761 search results - page 69 / 153 » Efficient Approximation Algorithms for the Subset-Sums Equal... |
VLDB
2005
ACM
14 years 8 months ago
2005
ACM
Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, t...
TSP
2008
13 years 7 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
CVPR
2010
IEEE
14 years 2 months ago
2010
IEEE
We present an interactive approach for segmenting thin volumetric structures. The proposed segmentation model is based on an anisotropic weighted Total Variation energy with a glob...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...