968 search results - page 22 / 194 » A faster implementation of APlace |
WIA
2000
Springer
14 years 1 months ago
2000
Springer
The Mona tool provides an implementation of the decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in prac...
BIBE
2008
IEEE
14 years 4 months ago
2008
IEEE
— This paper describes a design and implementation of the Smith-Waterman algorithm accelerated on the graphics processing unit (GPU). Our method is implemented using compute uniï...
IPPS
2006
IEEE
14 years 3 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
SMA
2009
ACM
14 years 4 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
SIGCOMM
1995
ACM
14 years 1 months ago
1995
ACM
Distributedmultimedia applicationsrequire performanceguarantees from the underlying network subsystem. Ethernet has been the dominant local area network architecture in the last d...