164 search results - page 20 / 33 » Adaptive Algorithms for Planar Convex Hull Problems |
DBPL
1999
Springer
13 years 12 months ago
1999
Springer
Linear constraint databases and query languages are appropriate for spatial database applications. Not only the data model is natural to represent a large portion of spatial data s...
RECOMB
1997
Springer
13 years 11 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 ...
CCCG
2010
13 years 9 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...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
In real-world environments it usually is difficult to specify target operating conditions precisely, for example, target misclassification costs. This uncertainty makes building ro...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—We study two convex optimization problems in a multi-class M/G/1 queue with adjustable service rates: minimizing convex functions of the average delay vector, and minimizing ave...