Sciweavers

CVPR
2012
IEEE
12 years 1 months ago
Saliency filters: Contrast based filtering for salient region detection
Saliency estimation has become a valuable tool in image processing. Yet, existing approaches exhibit considerable variation in methodology, and it is often difficult to attribute...
Federico Perazzi, Philipp Krähenbühl, Ya...
CVPR
2012
IEEE
12 years 1 months ago
On multiple foreground cosegmentation
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
Gunhee Kim, Eric P. Xing
CVPR
2012
IEEE
12 years 1 months ago
Sum-product networks for modeling activities with stochastic structure
This paper addresses recognition of human activities with stochastic structure, characterized by variable spacetime arrangements of primitive actions, and conducted by a variable ...
Mohamed R. Amer, Sinisa Todorovic
JMLR
2012
12 years 1 months ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski
JC
2007
96views more  JC 2007»
13 years 11 months ago
Error linear complexity measures for multisequences
Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments ...
Wilfried Meidl, Harald Niederreiter, Ayineedi Venk...
TIT
2008
78views more  TIT 2008»
13 years 11 months ago
New Binary Sequences With Optimal Autocorrelation Magnitude
New binary sequences of period
Nam Yul Yu, Guang Gong
TIT
2008
127views more  TIT 2008»
13 years 11 months ago
List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity
Let a biorthogonal Reed
Ilya Dumer, Gregory A. Kabatiansky, Cédric ...
JC
2008
84views more  JC 2008»
13 years 11 months ago
On the linear complexity of Sidel'nikov sequences over nonprime fields
We introduce a generalization of Sidel'nikov sequences for arbitrary finite fields. We show that several classes of Sidel'nikov sequences over arbitrary finite fields ex...
Nina Brandstätter, Wilfried Meidl
CORR
2006
Springer
71views Education» more  CORR 2006»
13 years 11 months ago
Wreath Products in Stream Cipher Design
The paper develops a novel approach to stream cipher design: Both the state update function and the output function of the corresponding pseudorandom generators are compositions of...
Vladimir Anashin
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 11 months ago
The Linear Complexity of a Graph
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
David L. Neel, Michael E. Orrison