Sciweavers

5138 search results - page 240 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
DKE
2002
107views more  DKE 2002»
15 years 6 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
PAMI
2010
207views more  PAMI 2010»
15 years 1 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf
ICALP
2005
Springer
16 years 1 days ago
Quantum Complexity of Testing Group Commutativity
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
Frédéric Magniez, Ashwin Nayak
ICML
2010
IEEE
15 years 7 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long
ICIP
2008
IEEE
16 years 8 months ago
Localization of sparse image tampering via random projections
Hashes can be used to provide authentication of multimedia contents. In the case of images, a hash can be used to detect whether the data has been modified in an illegitimate way....
Marco Tagliasacchi, Giuseppe Valenzise, Stefano Tu...