Sciweavers

363 search results - page 27 / 73
» Partial Multicuts in Trees
Sort
View
ISMIS
2000
Springer
14 years 1 months ago
Top-Down Query Processing in First Order Deductive Databases under the DWFS
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
C. A. Johnson
JSAT
2008
57views more  JSAT 2008»
13 years 9 months ago
tts: A SAT-Solver for Small, Difficult Instances
The Ternary Tree Solver (tts) is a complete solver for propositional satisfiability which was designed to have good performance on the most difficult small instances. It uses a st...
Ivor Spence
EMNLP
2009
13 years 7 months ago
Convolution Kernels on Constituent, Dependency and Sequential Structures for Relation Extraction
This paper explores the use of innovative kernels based on syntactic and semantic structures for a target relation extraction task. Syntax is derived from constituent and dependen...
Truc-Vien T. Nguyen, Alessandro Moschitti, Giusepp...
IROS
2008
IEEE
165views Robotics» more  IROS 2008»
14 years 4 months ago
Probabilistic navigation in dynamic environment using Rapidly-exploring Random Trees and Gaussian processes
— The paper describes a navigation algorithm for dynamic, uncertain environment. Moving obstacles are supposed to move on typical patterns which are pre-learned and are represent...
Chiara Fulgenzi, Christopher Tay, Anne Spalanzani,...
XIMEP
2004
ACM
74views Database» more  XIMEP 2004»
14 years 3 months ago
Schema Validation and Type Annotation for Encoded Trees
We argue that efficient support for schema validation and type annotation in XQuery processors deserves as much attention as efficient evaluation techniques for XPath queries have...
Torsten Grust, Stefan Klinger