Sciweavers

35 search results - page 5 / 7
» Maximum Matchings in Regular Graphs of High Girth
Sort
View
DATE
2005
IEEE
109views Hardware» more  DATE 2005»
14 years 2 months ago
ISEGEN: Generation of High-Quality Instruction Set Extensions by Iterative Improvement
Customization of processor architectures through Instruction Set Extensions (ISEs) is an effective way to meet the growing performance demands of embedded applications. A high-qua...
Partha Biswas, Sudarshan Banerjee, Nikil D. Dutt, ...
IPPS
2006
IEEE
14 years 2 months ago
Power consumption comparison for regular wireless topologies using fault-tolerant beacon vector routing
Fault-tolerant Beacon Vector Routing (FBVR) is an efficient technique for routing in the presence of node failures. Several common wireless topologies exist that can be used with...
Luke Demoracski, Dimiter R. Avresky
ANCS
2007
ACM
14 years 16 days ago
Compiling PCRE to FPGA for accelerating SNORT IDS
Deep Payload Inspection systems like SNORT and BRO utilize regular expression for their rules due to their high expressibility and compactness. The SNORT IDS system uses the PCRE ...
Abhishek Mitra, Walid A. Najjar, Laxmi N. Bhuyan
JAIR
1998
92views more  JAIR 1998»
13 years 8 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson
ISCI
2007
170views more  ISCI 2007»
13 years 8 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke