1082 search results - page 146 / 217 » Approximation Algorithms for Spreading Points |
ICLP
2009
Springer
14 years 9 months ago
2009
Springer
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
ICIAR
2005
Springer
14 years 2 months ago
2005
Springer
In this study, we propose two algorithms for measuring the distance between shape boundaries. In the algorithms, shape boundary is represented by the Beam Angle Statistics (BAS), w...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— Q-learning is a technique used to compute an optimal policy for a controlled Markov chain based on observations of the system controlled using a non-optimal policy. It ...
KDD
1997
ACM
14 years 1 months ago
1997
ACM
In this paper 1 we present a method for discovering approximately common motifs (also known as active motifs) in three dimensional (3D) molecules. Each node in a molecule is repre...
ESA
2000
Springer
14 years 23 days ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...