Sciweavers

2168 search results - page 43 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
141
Voted
KDD
2006
ACM
200views Data Mining» more  KDD 2006»
16 years 3 months ago
A Random-Walk Based Scoring Algorithm Applied to Recommender Engines
Recommender systems are an emerging technology that helps consumers find interesting products and useful resources. A recommender system makes personalized product suggestions by e...
Augusto Pucci, Marco Gori, Marco Maggini
107
Voted
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 9 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day
115
Voted
CCS
2007
ACM
15 years 8 months ago
An algorithm for the appraisal of assurance indicators for complex business processes
In order to provide certified security services we must provide indicators that can measure the level of assurance that a complex business process can offer. Unfortunately the fo...
Fabio Massacci, Artsiom Yautsiukhin
143
Voted
ATAL
2010
Springer
15 years 3 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
111
Voted
DCC
2005
IEEE
16 years 2 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said