Sciweavers

444 search results - page 37 / 89
» Selectional Restrictions in HPS
Sort
View
ENTCS
2007
123views more  ENTCS 2007»
13 years 9 months ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...
PC
2000
100views Management» more  PC 2000»
13 years 9 months ago
Parallel optimisation algorithms for multilevel mesh partitioning
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...
Chris Walshaw, Mark Cross
SAJ
2002
127views more  SAJ 2002»
13 years 9 months ago
Limited flooding protocol for mobile ad hoc networks
Mobile ad hoc networks are collections of mobile nodes without any fixed infrastructure or central co-ordinating mechanism for packet routing. Consequently, routing is a challenge...
Mieso K. Denko, W. Goddard
ACL
2010
13 years 8 months ago
Learning Arguments and Supertypes of Semantic Relations Using Recursive Patterns
A challenging problem in open information extraction and text mining is the learning of the selectional restrictions of semantic relations. We propose a minimally supervised boots...
Zornitsa Kozareva, Eduard H. Hovy
EDBT
2009
ACM
165views Database» more  EDBT 2009»
13 years 7 months ago
Exploiting the power of relational databases for efficient stream processing
Stream applications gained significant popularity over the last years that lead to the development of specialized stream engines. These systems are designed from scratch with a di...
Erietta Liarou, Romulo Goncalves, Stratos Idreos