13603 search results - page 2340 / 2721 » On the Complexity of Computing Treelength |
202
click to vote
CIKM
2000
Springer
16 years 1 days ago
2000
Springer
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
182
click to vote
COLT
2000
Springer
16 years 1 days ago
2000
Springer
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...
195
click to vote
CSL
2000
Springer
16 years 1 days ago
2000
Springer
We define three composition and structuring concepts which reflect frequently used refinements of ASMs and integrate standard structuring constructs into the global state based ...
217
click to vote
AGP
1999
IEEE
16 years 1 days ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
208
click to vote
CODES
1999
IEEE
16 years 1 days ago
1999
IEEE
We propose a system synthesis method which bridges the gap between a highly abstract functional model and an efficient hardware or software implementation. The functional model is...