141 search results - page 24 / 29 » Self-improving Algorithms for Convex Hulls |
129
click to vote
ICGI
2004
Springer
15 years 9 months ago
2004
Springer
The present work studies clustering from an abstract point of view and investigates its properties in the framework of inductive inference. Any class S considered is given by a hyp...
117
click to vote
CCCG
2010
15 years 5 months ago
2010
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
148
click to vote
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
130
click to vote
MP
1998
15 years 3 months ago
1998
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
130
click to vote
RECOMB
1997
Springer
15 years 8 months ago
1997
Springer
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...