1403 search results - page 245 / 281 » Set cover algorithms for very large datasets |
JAIR
2000
13 years 8 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
TIP
1998
13 years 8 months ago
1998
Abstract—We propose a method for the reconstruction of signals and images observed partially through a linear operator with a large support (e.g., a Fourier transform on a sparse...
ICS
2010
Tsinghua U.
14 years 5 months ago
2010
Tsinghua U.
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
ICDE
2011
IEEE
13 years 6 days ago
2011
IEEE
— The study of skylines and their variants has received considerable attention in recent years. Skylines are essentially sets of most interesting (undominated) tuples in a databa...
BMCBI
2004
13 years 8 months ago
2004
Background: The main goal in analyzing microarray data is to determine the genes that are differentially expressed across two types of tissue samples or samples obtained under two...