1145 search results - page 36 / 229 » Discrete Green's Functions |
168
click to vote
COMPGEOM
2009
ACM
16 years 16 days ago
2009
ACM
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...
156
click to vote
NIPS
2007
15 years 7 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
149
click to vote
FSTTCS
2006
Springer
15 years 9 months ago
2006
Springer
Given a set P of n points on the real line and a (potentially innite) family of functions, we investigate the problem of nding a small (weighted) subset S P, such that for any f ...
149
click to vote
WSC
2001
15 years 7 months ago
2001
In this paper we present an algorithm for simulating functions of the minimum and terminal value for a random walk with Gaussian increments. These expectations arise in connection...
138
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we present the derivation details, logic, and motivation for the three loop calculus introduced in Chertkov and Chernyak (2006 Phys. Rev. E 73 065102(R)). Generating ...