Sciweavers

1525 search results - page 176 / 305
» Matching with Regular Constraints
Sort
View
FROCOS
2000
Springer
15 years 8 months ago
Compiling Multi-Paradigm Declarative Programs into Prolog
This paper describes a high-level implementation of the concurrent constraint functional logic language Curry. The implementation, directed by the lazy pattern matching strategy of...
Sergio Antoy, Michael Hanus
IJCV
2010
131views more  IJCV 2010»
15 years 2 months ago
Using the Particle Filter Approach to Building Partial Correspondences Between Shapes
Abstract Constructing correspondencesbetween points characterizing one shape with those characterizing another is crucial to understanding what the two shapes have in common. These...
Rolf Lakämper, Marc Sobel
HPCN
1997
Springer
15 years 8 months ago
Parallel Solution of Irregular, Sparse Matrix Problems Using High Performance Fortran
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
Eric de Sturler, Damian Loher
ICSE
2008
IEEE-ACM
16 years 5 months ago
Symbolic mining of temporal specifications
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...
Mark Gabel, Zhendong Su
BMCBI
2005
100views more  BMCBI 2005»
15 years 4 months ago
Speeding disease gene discovery by sequence based candidate prioritization
Background: Regions of interest identified through genetic linkage studies regularly exceed 30 centimorgans in size and can contain hundreds of genes. Traditionally this number is...
Euan A. Adie, Richard R. Adams, Kathryn L. Evans, ...