Sciweavers

1700 search results - page 71 / 340
» Combinatorial Pattern Matching
Sort
View
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
13 years 7 months ago
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
Alfonsas Misevicius
DAM
2008
103views more  DAM 2008»
13 years 7 months ago
Counting preimages of TCP reordering patterns
Packet reordering is an important property of network traffic that should be captured by analytical models of the Transmission Control Protocol (TCP). We study a combinatorial pro...
Anders Hansson, Gabriel Istrate
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...
AINA
2006
IEEE
14 years 1 months ago
Efficient Packet Matching for Gigabit Network Intrusion Detection using TCAMs
Ternary content-addressable memories (TCAMs) have gained wide acceptance in the industry for storing and searching patterns in routers. But two important problems block the way to...
Ming Gao, Kenong Zhang, Jiahua Lu
ICPR
2000
IEEE
14 years 3 days ago
Piecewise Linear Two-Dimensional Warping
A new efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires by far less complexity than previous DPbased elastic mat...
Seiichi Uchida, Hiroaki Sakoe