909 search results - page 59 / 182 » Performance Evaluation of the VF Graph Matching Algorithm |
116
click to vote
FPL
2008
Springer
15 years 2 months ago
2008
Springer
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...
110
click to vote
JAIR
2007
15 years 1 months ago
2007
In this paper we present and evaluate a general framework for the design of truthful auctions for matching agents in a dynamic, two-sided market. A single commodity, such as a res...
116
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
112
click to vote
PLDI
2004
ACM
15 years 6 months ago
2004
ACM
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
105
click to vote
FORTE
2008
15 years 2 months ago
2008
In software engineering, graphical formalisms, like state-transition tables and automata, are very often indispensable parts of the specifications. Such a formalism usually leads t...