8298 search results - page 1351 / 1660 » On the Complexity of Numerical Analysis |
197
click to vote
WABI
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. Traditional sequence comparison by alignment applies a mutation model comprising two events, substitutions and indels (insertions or deletions) of single positions (SI). ...
187
click to vote
WABI
2005
Springer
16 years 8 days ago
2005
Springer
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
192
click to vote
CF
2004
ACM
16 years 7 days ago
2004
ACM
Aimed to provide computation ubiquitously, pervasive computing is perceived as a means to provide a user the transparency of anywhere, anyplace, anytime computing. Pervasive compu...
158
click to vote
COMPGEOM
2004
ACM
16 years 7 days ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
169
click to vote
COMPGEOM
2004
ACM
16 years 7 days ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...