Sciweavers

1381 search results - page 102 / 277
» Structural signatures for tree data structures
Sort
View
TCS
2010
14 years 8 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
COLING
1992
14 years 11 months ago
Term-Rewriting As A Basis For A Uniform Architecture In Machine Translation
In machine translation (MT) dierent levels of representation can be used to translate a source language sentence onto its target language equivalent. These levels have to be relat...
Wilhelm Weisweber
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 2 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
INFOCOM
2007
IEEE
15 years 4 months ago
TriBiCa: Trie Bitmap Content Analyzer for High-Speed Network Intrusion Detection
Abstract—Deep packet inspection (DPI) is often used in network intrusion detection and prevention systems (NIDPS), where incoming packet payloads are compared against known attac...
N. Sertac Artan, H. Jonathan Chao
ICML
2008
IEEE
15 years 10 months ago
Fast nearest neighbor retrieval for bregman divergences
We present a data structure enabling efficient nearest neighbor (NN) retrieval for bregman divergences. The family of bregman divergences includes many popular dissimilarity measu...
Lawrence Cayton