Sciweavers

433 search results - page 52 / 87
» Optimal Segmentation of Random Sequences
Sort
View
CORR
2006
Springer
115views Education» more  CORR 2006»
14 years 12 months ago
Entropy-optimal Generalized Token Bucket Regulator
Abstract-- We derive the maximum entropy of a flow (information utility) which conforms to traffic constraints imposed by a generalized token bucket regulator, by taking into accou...
Ashutosh Deepak Gore, Abhay Karandikar
BMCBI
2007
154views more  BMCBI 2007»
14 years 12 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...
ICPR
2008
IEEE
15 years 6 months ago
Robust indoor activity recognition via boosting
In this paper, a novel statistical indoor activity recognition algorithm is introduced. While conditional random fields (CRFs) have prominent properties to this task, no optimal ...
Masamichi Shimosaka, Taketoshi Mori, Tomomasa Sato
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 3 days ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
ICCV
2009
IEEE
1069views Computer Vision» more  ICCV 2009»
16 years 4 months ago
An efficient algorithm for Co-segmentation
This paper is focused on the Co-segmentation problem [1] – where the objective is to segment a similar object from a pair of images. The background in the two images may be ar...
Dorit S. Hochbaum, Vikas Singh