Sciweavers

19320 search results - page 35 / 3864
» On the complexity of computing determinants
Sort
View
ASIACRYPT
2010
Springer
14 years 7 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan
ISCAS
2006
IEEE
145views Hardware» more  ISCAS 2006»
15 years 3 months ago
The wordlength determination problem of linear time invariant systems with multiple outputs - a geometric programming approach
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
S. C. Chan, K. M. Tsui
MCU
2004
59views Hardware» more  MCU 2004»
14 years 11 months ago
On the Complexity of Universal Programs
Abstract. This paper provides a framework enabling to define and determine the complexity of various universal programs U for various machines. The approach consists of first defin...
Alain Colmerauer
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
KR
2004
Springer
15 years 3 months ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang