Sciweavers

2057 search results - page 37 / 412
» Quadratic placement using an improved timing model
Sort
View
CATS
2007
15 years 7 months ago
A Linear Time Algorithm for Pricing European Sequential Barrier Options
Financial derivatives are contracts concerning rights and obligations to engage in future transactions on some underlying financial instrument. A major concern in financial mark...
Peng Gao, Ron van der Meyden
CVPR
2010
IEEE
16 years 1 months ago
Nonparametric Higher-Order Learning for Interactive Segmentation
In this paper, we deal with a generative model for multi-label, interactive segmentation. To estimate the pixel likelihoods for each label, we propose a new higher-order formulatio...
Tae Hoon Kim (Seoul National University), Kyoung M...
135
Voted
ALMOB
2008
95views more  ALMOB 2008»
15 years 5 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen
134
Voted
ESA
2008
Springer
96views Algorithms» more  ESA 2008»
15 years 7 months ago
Stabbing Convex Polygons with a Segment or a Polygon
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. G...
141
Voted
COMPGEOM
2007
ACM
15 years 9 months ago
Guard placement for efficient point-in-polygon proofs
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...