Sciweavers

152 search results - page 10 / 31
» Expected time analysis for Delaunay point location
Sort
View
COMPGEOM
2010
ACM
15 years 4 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
BMCBI
2010
147views more  BMCBI 2010»
14 years 12 months ago
Automatic detection of anchor points for multiple sequence alignment
Background: Determining beforehand specific positions to align (anchor points) has proved valuable for the accuracy of automated multiple sequence alignment (MSA) software. This f...
Florian Pitschi, Claudine Devauchelle, Eduardo Cor...
SAC
2003
ACM
15 years 5 months ago
Manpower Scheduling with Time Windows
In this paper, we propose a manpower allocation model with time windows which is of practical interest to serviceman scheduling operations. Specifically, this problem originates f...
Andrew Lim, Brian Rodrigues, Lei Song
EMSOFT
2009
Springer
15 years 6 months ago
Probabilistic modeling of data cache behavior
In this paper, we propose a formal analysis approach to estimate the expected (average) data cache access time of an application across all possible program inputs. Towards this g...
Vinayak Puranik, Tulika Mitra, Y. N. Srikant
COMPGEOM
2011
ACM
14 years 3 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang