Sciweavers

1691 search results - page 204 / 339
» Restricted subset selection
Sort
View
ENTCS
2008
62views more  ENTCS 2008»
15 years 4 months ago
Undecidable Control Conditions in Graph Transformation Units
Graph transformation units are an approach-independent concept for programming by applying rules and imported transformation units to graphs, starting in an initial and ending in ...
Karsten Hölscher, Renate Klempien-Hinrichs, P...
ENTCS
2007
123views more  ENTCS 2007»
15 years 3 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»
15 years 3 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»
15 years 3 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
15 years 2 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