Sciweavers

14078 search results - page 2524 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
ANCS
2006
ACM
15 years 8 months ago
Packet classification using coarse-grained tuple spaces
While the problem of high performance packet classification has received a great deal of attention in recent years, the research community has yet to develop algorithmic methods t...
Haoyu Song, Jonathan S. Turner, Sarang Dharmapurik...
ALT
1997
Springer
15 years 7 months ago
Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries
A pattern is a string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from by substituti...
Thomas Erlebach, Peter Rossmanith, Hans Stadtherr,...
FOCS
1995
IEEE
15 years 7 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
ECAI
2010
Springer
15 years 5 months ago
Parallel TBox Classification in Description Logics - First Experimental Results
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
Mina Aslani, Volker Haarslev
AI
2010
Springer
15 years 4 months ago
Logic-based ontology comparison and module extraction, with an application to DL-Lite
We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of `lightweight' description...
Roman Kontchakov, Frank Wolter, Michael Zakharyasc...
« Prev « First page 2524 / 2816 Last » Next »