Sciweavers

5785 search results - page 458 / 1157
» Approximability of Probability Distributions
Sort
View
183
Voted
APPROX
2005
Springer
122views Algorithms» more  APPROX 2005»
16 years 12 days ago
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Uriel Feige, Eran Ofek
FC
2005
Springer
97views Cryptology» more  FC 2005»
16 years 11 days ago
Probabilistic Escrow of Financial Transactions with Cumulative Threshold Disclosure
Abstract. We propose a scheme for privacy-preserving escrow of financial transactions. The objective of the scheme is to preserve privacy and anonymity of the individual user enga...
Stanislaw Jarecki, Vitaly Shmatikov
MFCS
2005
Springer
16 years 10 days ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
ECAI
2004
Springer
16 years 7 days ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
Laurent Péret, Frédérick Garc...
ICC
1997
IEEE
15 years 11 months ago
Performance Models for Multiplexed VBR MPEG Video Sources
: This paper performs issues relative to modeling of VBR MPEG coded video sources over ATM B-ISDN networks. Firstly, we analyse the statistical characteristics of the three types o...
Nikolaos D. Doulamis, Anastasios D. Doulamis, Geor...