253 search results - page 4 / 51 » The Sketching Complexity of Pattern Matching |
ICDE
2011
IEEE
14 years 1 months ago
2011
IEEE
— We demonstrate a hardware implementation of a complex event processor, built on top of field-programmable gate arrays (FPGAs). Compared to CPU-based commodity systems, our sol...
ISPD
1998
ACM
15 years 1 months ago
1998
ACM
We propose a simple, isometry invariant pattern matching algorithm for an effective data reduction useful in layout-related data processing of very complex IC designs. The repeata...
81
Voted
WIRTSCHAFTSINFORMATI
2007
14 years 10 months ago
2007
: This paper sketches an approach to designing organization-specific information models for Enterprise Architecture (EA) Management based on patterns. Thus we intend to support th...
87
Voted
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Searching data streams has been traditionally very limited, either in the complexity of the search or in the size of the searched dataset. In this paper, we investigate the design...
CHI
2006
ACM
15 years 10 months ago
2006
ACM
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...