205 search results - page 19 / 41 » On Approximation Algorithms for Hierarchical MAX-SAT |
124
click to vote
COMPGEOM
2008
ACM
15 years 1 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
235
click to vote
ICDE
2012
IEEE
13 years 2 months ago
2012
IEEE
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 ...
105
click to vote
PODS
2005
ACM
15 years 5 months ago
2005
ACM
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hie...
135
click to vote
KDD
2003
ACM
16 years 5 days ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
129
click to vote
CASES
2003
ACM
2003
ACM
A hierarchical approach for energy efficient application design using heterogeneous embedded systems
15 years 3 months ago
Several features such as reconfiguration, voltage and frequency scaling, low-power operating states, duty-cycling, etc. are exploited for latency and energy efficient application ...