Sciweavers

4378 search results - page 159 / 876
» On the Complexity of Ordered Colourings
Sort
View
QEST
2006
IEEE
16 years 15 days ago
Bound-Preserving Composition for Markov Reward Models
Stochastic orders can be applied to Markov reward models and used to aggregate models, while introducing a bounded error. Aggregation reduces the number of states in a model, miti...
David Daly, Peter Buchholz, William H. Sanders
ICMCS
2005
IEEE
117views Multimedia» more  ICMCS 2005»
16 years 3 days ago
Estimation of MPEG-7 Transcoding Hints in the Compressed Domain
Video transcoding is a mechanism to convert video bitstreams from one coding format to other formats. In this operation, the computational complexity and picture quality are the t...
Marco Fumagalli, Rosa Lancini
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 6 months ago
Multi-View Active Learning in the Non-Realizable Case
The sample complexity of active learning under the realizability assumption has been well-studied. The realizability assumption, however, rarely holds in practice. In this paper, ...
Wei Wang, Zhi-Hua Zhou
AUSDM
2006
Springer
85views Data Mining» more  AUSDM 2006»
15 years 10 months ago
A Framework of Combining Markov Model With Association Rules for Predicting Web Page Accesses
The importance of predicting Web users' behaviour and their next movement has been recognised and discussed by many researchers lately. Association rules and Markov models ar...
Faten Khalil, Jiuyong Li, Hua Wang
CORR
2011
Springer
195views Education» more  CORR 2011»
15 years 1 months ago
Simplicial Homology of Random Configurations
Given a Poisson process on a d-dimensional torus, its random geometric simplicial complex is the complex whose vertices are the points of the Poisson process and simplices are give...
Laurent Decreusefond, Eduardo Ferraz, Hugues Randr...