Sciweavers

872 search results - page 117 / 175
» Extreme lower probabilities
Sort
View
PODS
2006
ACM
96views Database» more  PODS 2006»
15 years 12 months ago
Efficient gossip-based aggregate computation
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...
MOBIHOC
2001
ACM
15 years 11 months ago
A probabilistic analysis for the range assignment problem in ad hoc networks
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...
Paolo Santi, Douglas M. Blough, Feodor S. Vainstei...
DCC
2007
IEEE
15 years 11 months ago
Bounds on Redundancy in Constrained Delay Arithmetic Coding
We address the problem of a finite delay constraint in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large ...
Ofer Shayevitz, Eado Meron, Meir Feder, Ram Zamir
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
15 years 9 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
ETRA
2010
ACM
176views Biometrics» more  ETRA 2010»
15 years 6 months ago
Learning relevant eye movement feature spaces across users
In this paper we predict the relevance of images based on a lowdimensional feature space found using several users’ eye movements. Each user is given an image-based search task,...
Zakria Hussain, Kitsuchart Pasupa, John Shawe-Tayl...