Sciweavers

7303 search results - page 200 / 1461
» Optimality for dynamic patterns
Sort
View
IPPS
2007
IEEE
15 years 9 months ago
Using Rewriting Logic to Match Patterns of Instructions from a Compiler Intermediate Form to Coarse-Grained Processing Elements
This paper presents a new and retargetable method to identify patterns of instructions with direct support in coarsegrained processing elements (PEs). The method uses a three-addr...
Carlos Morra, João M. P. Cardoso, Jürg...
109
Voted
VLDB
2005
ACM
82views Database» more  VLDB 2005»
15 years 8 months ago
Stack-based Algorithms for Pattern Matching on DAGs
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
Li Chen, Amarnath Gupta, M. Erdem Kurul
NIPS
1996
15 years 4 months ago
Transformation Invariance in Pattern Recognition-Tangent Distance and Tangent Propagation
In pattern recognition, statistical modeling, or regression, the amount of data is a critical factor affecting the performance. If the amount of data and computational resources ar...
Patrice Simard, Yann LeCun, John S. Denker, Bernar...
JEI
2002
133views more  JEI 2002»
15 years 3 months ago
Prediction of the texture visibility of color halftone patterns
Abstract. We propose a metric to predict the visibility of color halftone textures. This metric is represented by the critical viewing distance below which the halftone textures ca...
Muge Wang, Kevin J. Parker
PRL
1998
93views more  PRL 1998»
15 years 3 months ago
A connectionist method for pattern classification with diverse features
A novel connectionist method is proposed to simultaneously use diverse features in an optimal way for pattern classification. Unlike methods of combining multiple classifiers, a m...
Ke Chen 0001