Sciweavers

613 search results - page 71 / 123
» The Model-Summary Problem and a Solution for Trees
Sort
View
CADE
2005
Springer
15 years 10 months ago
Well-Nested Context Unification
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
Jordi Levy, Joachim Niehren, Mateu Villaret
RTA
2007
Springer
15 years 3 months ago
Proving Termination of Rewrite Systems Using Bounds
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
Martin Korp, Aart Middeldorp
COLING
2008
14 years 11 months ago
Exact Inference for Multi-label Classification using Sparse Graphical Models
This paper describes a parameter estimation method for multi-label classification that does not rely on approximate inference. It is known that multi-label classification involvin...
Yusuke Miyao, Jun-ichi Tsujii
CP
2005
Springer
15 years 3 months ago
Multi-point Constructive Search
Abstract. Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting se...
J. Christopher Beck
MOBIHOC
2006
ACM
15 years 9 months ago
Mobile backbone networks --: construction and maintenance
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
Anand Srinivas, Gil Zussman, Eytan Modiano