Sciweavers

3898 search results - page 35 / 780
» On the Bit Extraction Problem
Sort
View
JEI
2000
133views more  JEI 2000»
14 years 9 months ago
Low complexity block motion estimation using morphological-based feature extraction and XOR operations
Motion estimation is a temporal image compression technique, where an n x n block of pixels in the current frame of a video sequence is represented by a motion vector with respect...
Thinh M. Le, R. Mason, Sethuraman Panchanathan
FOCS
1993
IEEE
15 years 1 months ago
Dynamic Word Problems
Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, S...
CORR
2008
Springer
88views Education» more  CORR 2008»
14 years 10 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
ICCAD
1997
IEEE
126views Hardware» more  ICCAD 1997»
15 years 2 months ago
An output encoding problem and a solution technique
We present a new output encoding problem as follows: Given a specification table, such as a truth table or a finite state machine state table, where some of the outputs are specif...
Subhasish Mitra, LaNae J. Avra, Edward J. McCluske...
JC
2007
94views more  JC 2007»
14 years 9 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou