Sciweavers

4966 search results - page 214 / 994
» its 2010
Sort
View
RP
2010
Springer
163views Control Systems» more  RP 2010»
15 years 4 months ago
Efficient Graph Reachability Query Answering Using Tree Decomposition
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
Fang Wei
SEMWEB
2010
Springer
15 years 4 months ago
Towards Semantic Annotation Supported by Dependency Linguistics and ILP
In this paper we present a method for semantic annotation of texts, which is based on a deep linguistic analysis (DLA) and Inductive Logic Programming (ILP). The combination of DLA...
Jan Dedek
WINE
2010
Springer
177views Economy» more  WINE 2010»
15 years 4 months ago
Braess's Paradox in Large Sparse Graphs
Braess's paradox, in its original context, is the counter-intuitive observation that, without lessening demand, closing roads can improve traffic flow. With the explosion of d...
Fan Chung, Stephen J. Young
CAI
2010
Springer
15 years 4 months ago
Constrained Longest Common Subsequence Computing Algorithms in Practice
The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longe...
Sebastian Deorowicz, J. Obstoj
COMBINATORICA
2010
15 years 4 months ago
Formulae and growth rates of high-dimensional polycubes
A d-dimensional polycube is a facet-connected set of cubes in d dimensions. Fixed polycubes are considered distinct if they differ in their shape or orientation. A proper d-dimens...
Ronnie Barequet, Gill Barequet, Günter Rote