Sciweavers

4679 search results - page 238 / 936
» Modeling When Connections Are the Problem
Sort
View
COLING
1996
15 years 7 months ago
Dealing with Cross-Sentential Anaphora Resolution in ALEP
The experiments described here have been done in connection with the LS-GRAM project, which is concerned with the development of large scale grammars and thus foreseen the coverag...
Thierry Declerck
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
15 years 7 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...
BIODATAMINING
2008
119views more  BIODATAMINING 2008»
15 years 6 months ago
A survey of visualization tools for biological network analysis
The analysis and interpretation of relationships between biological molecules, networks and concepts is becoming a major bottleneck in systems biology. Very often the pure amount ...
Georgios A. Pavlopoulos, Anna-Lynn Wegener, Reinha...
AI
2006
Springer
15 years 6 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
JGAA
2006
108views more  JGAA 2006»
15 years 6 months ago
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
Sergio Cabello