1021 search results - page 95 / 205 » Fast Approximate PCPs |
194
click to vote
MFCS
2010
Springer
15 years 1 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...
145
click to vote
WAW
2010
Springer
15 years 27 days ago
2010
Springer
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
144
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
127
click to vote
TOG
2008
15 years 2 months ago
2008
Shadow computation in dynamic scenes under complex illumination is a challenging problem. Methods based on precomputation provide accurate, real-time solutions, but are hard to ex...
139
click to vote
DATESO
2007
15 years 4 months ago
2007
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...