Sciweavers

1399 search results - page 227 / 280
» Multi-party Finite Computations
Sort
View
IPPS
2010
IEEE
15 years 1 months ago
Head-body partitioned string matching for Deep Packet Inspection with scalable and attack-resilient performance
Abstract--Dictionary-based string matching (DBSM) is a critical component of Deep Packet Inspection (DPI), where thousands of malicious patterns are matched against high-bandwidth ...
Yi-Hua E. Yang, Viktor K. Prasanna, Chenqian Jiang
122
Voted
SEMWEB
2010
Springer
15 years 1 months ago
Using SPARQL to Test for Lattices: Application to Quality Assurance in Biomedical Ontologies
We present a scalable, SPARQL-based computational pipeline for testing the lattice-theoretic properties of partial orders represented as RDF triples. The use case for this work is ...
Guo-Qiang Zhang, Olivier Bodenreider
118
Voted
GI
2009
Springer
15 years 1 months ago
Information Fusion for Autonomous Robotic Weeding
: Information fusion has a potential applicability to a multitude of different applications. Still, the JDL model is mostly used to describe defense applications. This paper descri...
Stefan Ericson, Klas Hedenberg, Ronnie Johansson
ICC
2009
IEEE
116views Communications» more  ICC 2009»
15 years 1 months ago
Efficient Implementation of Binary Sequence Generator for WiMAX and WRAN on Programmable Digital Signal Processor
In this paper, an efficient design for implementing binary sequence generator on 32-bit instruction execution mode TI TMS320C6416 DSP is presented. The main goal is to achieve high...
Lok Tiing Tie, Ser Wah Oh, K. J. M. Kua
158
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 1 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker