9842 search results - page 1859 / 1969 » The Complexity of the Matching-Cut Problem |
CIKM
2000
Springer
14 years 2 months 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...
COLT
2000
Springer
14 years 2 months 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...
ECBS
2010
IEEE
14 years 2 months ago
2010
IEEE
The complexity of software in embedded systems has increased significantly over the last years so that software verification now plays an important role in ensuring the overall pr...
CA
1999
IEEE
14 years 2 months ago
1999
IEEE
This paper presents a simple and efficient method of modeling synthetic vision, memory, and learning for autonomous animated characters in real-time virtual environments. The mode...
ASPDAC
1999
ACM
14 years 2 months ago
1999
ACM
In this paper, we present a fast and efficient Iterative Improvement Partitioning (IIP) technique for VLSI circuits and hybrid bucket structures on its implementation. Due to thei...