Sciweavers

1213 search results - page 55 / 243
» Finding patterns in the fieldwork
Sort
View
94
Voted
MTPP
2010
14 years 11 months ago
A Fast General Parser for Automatic Code Generation
Abstract. The code generator in a compiler attempts to match a subject tree against a collection of tree-shaped patterns for generating instructions. Tree-pattern matching may be c...
Wuu Yang
109
Voted
SIGMOD
2010
ACM
183views Database» more  SIGMOD 2010»
14 years 7 months ago
TPC-E vs. TPC-C: characterizing the new TPC-E benchmark via an I/O comparison study
TPC-E is a new OLTP benchmark recently approved by the Transaction Processing Performance Council (TPC). In this paper, we compare TPC-E with the familiar TPCC benchmark in order ...
Shimin Chen, Anastasia Ailamaki, Manos Athanassoul...
ICDE
2008
IEEE
168views Database» more  ICDE 2008»
16 years 2 months ago
On Supporting Kleene Closure over Event Streams
Complex event patterns involving Kleene closure are finding application in a variety of stream environments for tracking and monitoring purposes. In this paper, we propose a compac...
Daniel Gyllstrom, Jagrati Agrawal, Yanlei Diao, Ne...
78
Voted
ICANNGA
2009
Springer
141views Algorithms» more  ICANNGA 2009»
15 years 5 months ago
Connection Strategies in Associative Memory Models with Spiking and Non-spiking Neurons
The problem we address in this paper is that of finding effective and parsimonious patterns of connectivity in sparse associative memories. This problem must be addressed in real n...
Weiliang Chen, Reinoud Maex, Rod Adams, Volker Ste...
DELTA
2008
IEEE
15 years 2 months ago
Test Set Stripping Limiting the Maximum Number of Specified Bits
This paper presents a technique that limits the maximum number of specified bits of any pattern in a given test set. The outlined method uses algorithms similar to ATPG, but explo...
Michael A. Kochte, Christian G. Zoellin, Michael E...