Sciweavers

2907 search results - page 136 / 582
» Presentations of Structures in Admissible Sets
Sort
View
ISAAC
2009
Springer
101views Algorithms» more  ISAAC 2009»
15 years 11 months ago
Maintaining Nets and Net Trees under Incremental Motion
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
Minkyoung Cho, David M. Mount, Eunhui Park
AAAI
2008
15 years 7 months ago
Backdoor Trees
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...
Marko Samer, Stefan Szeider
118
Voted
COLING
2000
15 years 6 months ago
Context-Free Grammar Rewriting and the Transfer of Packed Linguistic Representations
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...
Marc Dymetman, Frédéric Tendeau
ACL
1989
15 years 5 months ago
Automatic Acquisition of the Lexical Semantics of Verbs from Sentence Frames
This paper presents a computational model ofverb acquisitionwhich uses what we willcallthe principle of structured overeommitment to eliminate the need for negative evidence. The ...
Mort Webster, Mitchell P. Marcus
CG
2007
Springer
15 years 4 months ago
Visual text mining using association rules
In many situations, individuals or groups of individuals are faced with the need to examine sets of documents to achieve understanding of their structure and to locate relevant in...
Alneu de Andrade Lopes, Roberto Pinho, Fernando Vi...