Sciweavers

5105 search results - page 460 / 1021
» Approximate Structural Consistency
Sort
View
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
13 years 9 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
13 years 9 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
AAAI
2012
13 years 9 months ago
Advances in Lifted Importance Sampling
We consider lifted importance sampling (LIS), a previously proposed approximate inference algorithm for statistical relational learning (SRL) models. LIS achieves substantial vari...
Vibhav Gogate, Abhay Kumar Jha, Deepak Venugopal
CHI
2006
ACM
16 years 7 months ago
"Sketching" nurturing creativity: commonalities in art, design, engineering and research
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...
Kumiyo Nakakoji, Atau Tanaka, Daniel Fallman
EDBT
2008
ACM
167views Database» more  EDBT 2008»
16 years 7 months ago
HISSCLU: a hierarchical density-based method for semi-supervised clustering
In situations where class labels are known for a part of the objects, a cluster analysis respecting this information, i.e. semi-supervised clustering, can give insight into the cl...
Christian Böhm, Claudia Plant