Sciweavers

4940 search results - page 40 / 988
» On the Complexity of Universal Programs
Sort
View
COR
2010
123views more  COR 2010»
15 years 2 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...

Book
671views
17 years 27 days ago
Introduction to Programming for Image Analysis with VTK
"This book is an edited collection of class handouts that was written for the graduate seminar [Programming for Medical Image Analysis] (ENAS 920a). This class was taught at Y...
Xenophon Papademetris
ICASSP
2008
IEEE
15 years 8 months ago
Gradient steepness metrics using extended Baum-Welch transformations for universal pattern recognition tasks
In many pattern recognition tasks, given some input data and a family of models, the “best” model is defined as the one which maximizes the likelihood of the data given the m...
Tara N. Sainath, Dimitri Kanevsky, Bhuvana Ramabha...
CIE
2004
Springer
15 years 1 months ago
University of Southern California's Institute for Creative Technologies
When dealing with large, distributed systems that use state-of-the-art components, individual components are usually developed in parallel. As development continues, the decouplin...
Michael van Lent
ICDCS
2002
IEEE
15 years 6 months ago
The Complexity of Adding Failsafe Fault-Tolerance
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
Sandeep S. Kulkarni, Ali Ebnenasir