10988 search results - page 1978 / 2198 » Algorithmic Folding Complexity |
108
click to vote
JVCIR
2010
15 years 2 months ago
2010
Efficient representation of images usually leads to improvements in storage efficiency, computational complexity and performance of image processing algorithms. Efficient represe...
107
click to vote
KES
2010
Springer
15 years 2 months ago
2010
Springer
We develop a methodology to grasp temporal trend in a stock market that changes year to year, or sometimes within a year depending on numerous factors. For this purpose, we employ ...
131
click to vote
LATIN
2010
Springer
15 years 2 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
146
Voted
PE
2010
Springer
15 years 2 months ago
2010
Springer
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
152
click to vote
PKDD
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we propose a Bayesian model for multi-task feature selection. This model is based on a generalized spike and slab sparse prior distribution that enforces the selectio...