Sciweavers

1404 search results - page 160 / 281
» On General Laws of Complex Networks
Sort
View
IWANN
2001
Springer
15 years 9 months ago
Using Contextual Information to Selectively Adjust Preprocessing Parameters
Abstract. It is generally accepted that some of the problems and ambiguities at the low level of processing can not be resolved without taking into account contextual expectations....
Predrag Neskovic, Leon N. Cooper
DAGSTUHL
2006
15 years 5 months ago
Coxeter Lattice Paths
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations their com...
Thomas J. Ashby, Anthony D. Kennedy, Stephen M. Wa...
COMCOM
2007
111views more  COMCOM 2007»
15 years 4 months ago
An argument for simple embedded ACL optimisation
The difficulty of efficiently reordering the rules in an Access Control List is considered and the essential optimisation problem formulated. The complexity of exact and sophistic...
Vic Grout, John Davies, John McGinn
CCR
2010
151views more  CCR 2010»
15 years 1 months ago
iNFAnt: NFA pattern matching on GPGPU devices
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...
Niccolo Cascarano, Pierluigi Rolando, Fulvio Risso...
CN
2006
111views more  CN 2006»
15 years 4 months ago
Analytical modeling of CAC in next generation wireless systems
Though Connection Admission Control (CAC) in wireless networks has been studied extensively, the heterogeneous structure of Next Generation Wireless Systems (NGWS) makes CAC very ...
Tuna Tugcu, H. Birkan Yilmaz, Feodor S. Vainstein