205 search results - page 16 / 41 » On Approximation Algorithms for Hierarchical MAX-SAT |
112
click to vote
SIGMOD
2001
ACM
15 years 12 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
114
click to vote
EUROPAR
2005
Springer
15 years 5 months ago
2005
Springer
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
113
click to vote
ICRA
2009
IEEE
14 years 9 months ago
2009
IEEE
In Simultaneous Localisation and Mapping (SLAM), it is well known that probabilistic filtering approaches which aim to estimate the robot and map state sequentially suffer from poo...
ICML
2006
IEEE
16 years 18 days ago
2006
IEEE
We study hierarchical classification in the general case when an instance could belong to more than one class node in the underlying taxonomy. Experiments done in previous work sh...
106
click to vote
CGF
2010
14 years 10 months ago
2010
We focus on the class of regular models defined by Várady et al. for reverse engineering purposes. Given a 3D surface M represented through a dense set of points, we present a n...