Sciweavers

2031 search results - page 151 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
ICFP
2008
ACM
15 years 10 months ago
Pattern minimization problems over recursive data types
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Alexander Krauss
SIGDOC
2004
ACM
15 years 3 months ago
Assessing effectiveness of personality style in documentation
This paper extends previous work by other researchers that indicated that users of computers preferred a computer with a personality that was similar to theirs. We conducted a sim...
Kenneth Sayles, David G. Novick
ANCS
2006
ACM
15 years 1 months ago
Efficient memory utilization on network processors for deep packet inspection
Deep Packet Inspection (DPI) refers to examining both packet header and payload to look for predefined patterns, which is essential for network security, intrusion detection and c...
Piti Piyachon, Yan Luo
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 17 hour ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
SODA
2003
ACM
157views Algorithms» more  SODA 2003»
14 years 11 months ago
Competitive queueing policies for QoS switches
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
Nir Andelman, Yishay Mansour, An Zhu