Sciweavers

INFOCOM
2009
IEEE
14 years 4 months ago
Delay Analysis for Multi-Hop Wireless Networks
Abstract—We analyze the delay performance of a multihop wireless network with a fixed route between each sourcedestination pair. There are arbitrary interference constraints on ...
Gagan Rajesh Gupta, Ness B. Shroff
ICDAR
2009
IEEE
14 years 4 months ago
A Probabilistic Framework for Soft Target Learning in Online Cursive Handwriting Recognition
To develop effective learning algorithms for online cursive word recognition is still a challenge research issue. In this paper, we propose a probabilistic framework to model the ...
Xiaoyuan Zhu, Yong Ge, Feng-Jun Guo, Li-Xin Zhen
ICC
2009
IEEE
232views Communications» more  ICC 2009»
14 years 4 months ago
Degrees of Freedom and Sum Rate Maximization for Two Mutually Interfering Broadcast Channels
— In this paper, we derive a precise expression of spatial degrees of freedom (DOF) for two mutually interfering broadcast channels (IFBC) as a function of arbitrary numbers of t...
Seokhwan Park, Inkyu Lee
CSFW
2009
IEEE
14 years 4 months ago
Minimal Message Complexity of Asynchronous Multi-party Contract Signing
Multi-party contract signing protocols specify how a number of signers can cooperate in achieving a fully signed contract, even in the presence of dishonest signers. This problem h...
Sjouke Mauw, Sasa Radomirovic, Mohammad Torabi Das...
LATA
2009
Springer
14 years 4 months ago
A Series of Run-Rich Strings
We present a new series of run-rich strings, and give a new lower bound 0.94457567 of the maximum number of runs in a string. We also introduce the general conjecture about a asymp...
Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, A...
CVPR
2010
IEEE
14 years 6 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff
SOFSEM
2010
Springer
14 years 6 months ago
Parallel Randomized Load Balancing: A Lower Bound for a More General Model
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
Guy Even, Moti Medina
ALT
2002
Springer
14 years 6 months ago
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
Dietrich Braess, Jürgen Forster, Tomas Sauer,...
ALT
2008
Springer
14 years 6 months ago
A Uniform Lower Error Bound for Half-Space Learning
Abstract. We give a lower bound for the error of any unitarily invariant algorithm learning half-spaces against the uniform or related distributions on the unit sphere. The bound i...
Andreas Maurer, Massimiliano Pontil
SPAA
2009
ACM
14 years 6 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...