Sciweavers

8669 search results - page 1289 / 1734
» Computing matrix representations
Sort
View
ANCS
2006
ACM
15 years 11 months ago
Advanced algorithms for fast and scalable deep packet inspection
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...
Sailesh Kumar, Jonathan S. Turner, John Williams
SAC
2005
ACM
15 years 10 months ago
Automatic learning of text-to-concept mappings exploiting WordNet-like lexical networks
A great jump towards the advent of the Semantic Web will take place when a critical mass of web resources is available for use in a semantic way. This goal can be reached by the c...
Dario Bonino, Fulvio Corno, Federico Pescarmona
SMA
2005
ACM
167views Solid Modeling» more  SMA 2005»
15 years 10 months ago
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
Peter Hachenberger, Lutz Kettner
ATAL
2005
Springer
15 years 10 months ago
Modeling exceptions via commitment protocols
This paper develops a model for exceptions and an approach for incorporating them in commitment protocols among autonomous agents. Modeling and handling exceptions is critical for...
Ashok U. Mallya, Munindar P. Singh
BIRTHDAY
2004
Springer
15 years 10 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
« Prev « First page 1289 / 1734 Last » Next »