Sciweavers

2924 search results - page 531 / 585
» Lower Bounds in Distributed Computing
Sort
View
CORR
2006
Springer
146views Education» more  CORR 2006»
13 years 7 months ago
Oblivious-Transfer Amplification
Abstract. Oblivious transfer (OT) is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately...
Jürg Wullschleger
JAL
2008
74views more  JAL 2008»
13 years 7 months ago
Solving satisfiability in the tile assembly model with a constant-size tileset
Biological systems are far more complex and robust than systems we can engineer today. One way to increase the complexity and robustness of our engineered systems is to study how ...
Yuriy Brun
QUESTA
2010
86views more  QUESTA 2010»
13 years 6 months ago
Dynamic admission and service rate control of a queue
This paper investigates a queueing system in which the controller can perform admission and service rate control. In particular, we examine a single server queueing system with Po...
Kranthi Mitra Adusumilli, John J. Hasenbein
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 5 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
ICCV
2009
IEEE
13 years 5 months ago
Realtime background subtraction from dynamic scenes
This paper examines the problem of moving object detection. More precisely, it addresses the difficult scenarios where background scene textures in the video might change over tim...
Li Cheng, Minglun Gong