Sciweavers

1402 search results - page 237 / 281
» Searching Cycle-Disjoint Graphs
Sort
View
WLP
2004
Springer
14 years 3 months ago
Optimizing the Evaluation of XPath Using Description Logics
: The growing use of XML in commercial as well as non-commercial domains to transport information poses new challenges to concepts to access these information. Common ways to acces...
Peter Baumgartner, Ulrich Furbach, Margret Gro&szl...
IPPS
2003
IEEE
14 years 3 months ago
Mesh Partitioning: A Multilevel Ant-Colony-Optimization Algorithm
Mesh partitioning is an important problem that has extensive applications in many areas. Multilevel algorithms are a successful class of optimization techniques which addresses th...
Peter Korosec, Jurij Silc, Borut Robic
CICLING
2003
Springer
14 years 3 months ago
Per-node Optimization of Finite-State Mechanisms for Natural Language Processing
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
Alexander Troussov, Brian O'Donovan, Seppo Koskenn...
VLSID
2000
IEEE
75views VLSI» more  VLSID 2000»
14 years 2 months ago
Timing Analysis with Implicitly Specified False Paths
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
Eugene Goldberg, Alexander Saldanha
FOCS
1998
IEEE
14 years 2 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello