Sciweavers

166 search results - page 5 / 34
» Towards a theory of cache-efficient algorithms
Sort
View
QEST
2005
IEEE
14 years 1 months ago
An approximation algorithm for labelled Markov processes: towards realistic approximation
Abstract— Approximation techniques for labelled Markov processes on continuous state spaces were developed by Desharnais, Gupta, Jagadeesan and Panangaden. However, it has not be...
Alexandre Bouchard-Côté, Norm Ferns, ...
EMSOFT
2011
Springer
12 years 7 months ago
RT-Xen: towards real-time hypervisor scheduling in xen
As system integration becomes an increasingly important challenge for complex real-time systems, there has been a significant demand for supporting real-time systems in virtualiz...
Sisu Xi, Justin Wilson, Chenyang Lu, Christopher D...
ASP
2003
Springer
14 years 23 days ago
Implementing OCLP as a front-end for Answer Set Solvers: From Theory to Practice
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
Martin Brain, Marina De Vos
MFCS
2004
Springer
14 years 27 days ago
The Bidimensional Theory of Bounded-Genus Graphs
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...
ICDM
2008
IEEE
115views Data Mining» more  ICDM 2008»
14 years 2 months ago
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons
Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer ...
Jingu Kim, Haesun Park