51 search results - page 5 / 11 » Approximating (r, p)-Centroid on a Path |
WSC
2004
14 years 11 months ago
2004
Monte Carlo simulation can be readily applied to asset pricing problems with multiple state variables and possible path dependencies because convergence of Monte Carlo methods is ...
165
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
Transparent persistence promises to integrate programming languages and databases by allowing procedural programs to access persistent data with the same ease as non-persistent da...
IROS
2006
IEEE
15 years 4 months ago
2006
IEEE
Abstract— This paper introduces a method of building topological maps using sequences of images and the approximate string matching algorithm, which is commonly used in DNA seque...
94
Voted
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
81
Voted
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...