Sciweavers

141 search results - page 13 / 29
» Bounding basis reduction properties
Sort
View
CORR
2004
Springer
128views Education» more  CORR 2004»
13 years 9 months ago
Specialization of Functional Logic Programs Based on Needed Narrowing
Many functional logic languages are based on narrowing, a unification-based goal-solving mechanism which subsumes the reduction mechanism of functional languages and the resolutio...
María Alpuente, Michael Hanus, Salvador Luc...
ALT
2009
Springer
14 years 6 months ago
Complexity versus Agreement for Many Views
Abstract. The paper considers the problem of semi-supervised multiview classification, where each view corresponds to a Reproducing Kernel Hilbert Space. An algorithm based on co-...
Odalric-Ambrym Maillard, Nicolas Vayatis
LICS
1994
IEEE
14 years 1 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
ISSAC
1997
Springer
194views Mathematics» more  ISSAC 1997»
14 years 1 months ago
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington
JACM
2006
99views more  JACM 2006»
13 years 9 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller