Sciweavers

352 search results - page 23 / 71
» Fast Graph Pattern Matching
Sort
View
ARVLSI
1995
IEEE
78views VLSI» more  ARVLSI 1995»
13 years 11 months ago
A technique for high-speed, fine-resolution pattern generation and its CMOS implementation
This paper presents an architecture for generating a high-speed data pattern with precise edge placement resolution by using the matched delay technique. The technique involves ...
Gary C. Moyer, Mark Clements, Wentai Liu, Toby Sch...
CASCON
1997
85views Education» more  CASCON 1997»
13 years 9 months ago
Fast detection of communication patterns in distributed executions
Understanding distributed applications is a tedious and di cult task. Visualizations based on process-time diagrams are often used to obtain a better understanding of the executio...
Thomas Kunz, Michiel F. H. Seuren
GBRPR
2005
Springer
14 years 1 months ago
Adaptive Pyramid and Semantic Graph: Knowledge Driven Segmentation
A method allowing to integrate syntactic and semantic approaches in an automatic segmentation process is described. This integration is possible thanks to the formalism of graphs....
Aline Deruyver, Yann Hodé, Eric Laemmer, Je...
DIMVA
2006
13 years 9 months ago
Detecting Self-mutating Malware Using Control-Flow Graph Matching
Next generation malware will by be characterized by the intense use of polymorphic and metamorphic techniques aimed at circumventing the current malware detectors, based on pattern...
Danilo Bruschi, Lorenzo Martignoni, Mattia Monga
TIP
2002
109views more  TIP 2002»
13 years 7 months ago
Adaptive rood pattern search for fast block-matching motion estimation
In this paper, we propose a novel and simple fast block-matching algorithm (BMA), called adaptive rood pattern search (ARPS), which consists of two sequential search stages: 1) ini...
Yao Nie, Kai-Kuang Ma