Sciweavers

2107 search results - page 397 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
ANCS
2005
ACM
14 years 2 months ago
Fast and scalable pattern matching for content filtering
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packe...
Sarang Dharmapurikar, John W. Lockwood
ICALP
2005
Springer
14 years 2 months ago
The Generalized Deadlock Resolution Problem
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwa...
MM
2004
ACM
106views Multimedia» more  MM 2004»
14 years 2 months ago
Probabilistic delay guarantees using delay distribution measurement
Carriers increasingly differentiate their wide-area connectivity offerings by means of customized services, such as virtual private networks (VPN) with Quality of Service (QoS) g...
Kartik Gopalan, Tzi-cker Chiueh, Yow-Jian Lin
HOTOS
1993
IEEE
14 years 1 months ago
Object Groups May Be Better Than Pages
I argue against trying to solve the problem of clustering objects into disk pages. Instead, I propose that objects be fetched in groups that may be specific to an application or ...
Mark Day
PRL
2007
138views more  PRL 2007»
13 years 8 months ago
Ent-Boost: Boosting using entropy measures for robust object detection
Recently, boosting has come to be used widely in object-detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifier...
Duy-Dinh Le, Shin'ichi Satoh