1145 search results - page 103 / 229 » Discrete Green's Functions |
163
click to vote
FIMH
2007
Springer
16 years 17 days ago
2007
Springer
We present preliminary results of the numerical simulation of electrocardiograms (ECG). We consider the bidomain equations to model the electrical activity of the heart and a Lapla...
152
click to vote
DATE
2005
IEEE
16 years 19 hour ago
2005
IEEE
A class of discrete event synthesis problems can be reduced to solving language equations F • X ⊆ S, where F is the fixed component and S the specification. Sequential synthes...
182
click to vote
COMPGEOM
2000
ACM
15 years 10 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
167
click to vote
COMPGEOM
1997
ACM
15 years 10 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
154
click to vote
COMPGEOM
1990
ACM
15 years 10 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...