8780 search results - page 1532 / 1756 » On the Feasibility of Consistent Computations |
195
click to vote
PETRA
2010
ACM
15 years 8 months ago
2010
ACM
We study the performance of three dynamic programming methods on music retrieval. The methods are designed for time series matching but can be directly applied to retrieval of mus...
178
click to vote
ASUNAM
2010
IEEE
15 years 8 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
162
click to vote
AAAI
2010
15 years 8 months ago
2010
g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...
180
click to vote
ISMB
1997
1997
Inferring Gene Structures in Genomic Sequences Using Pattern Recognition and Expressed Sequence Tags
15 years 7 months ago
Abstract.) Ying Xu, Richard J. MuraF, and Edward C. Uberbacher Computer Science and Mathematics Division and tLife Sciences Division Computational methods for gene identification ...
201
click to vote
PPSC
1989
15 years 7 months ago
1989
The LAPACK software project currently under development is intended to provide a portable linear algebra library for high performance computers. LAPACK will make use of the Level 1...