Sciweavers

205 search results - page 32 / 41
» Complexity of Polynomial Multiplication over Finite Fields
Sort
View
CVIU
2010
89views more  CVIU 2010»
15 years 4 months ago
Spherical approximation for multiple cameras in motion estimation: Its applicability and advantages
Estimating motions of a multi-camera system which may not have overlapping fields of view is generally complex and computationally expensive because of the non-zero offset between...
Jun-Sik Kim, Myung Hwangbo, Takeo Kanade
ICIP
2003
IEEE
16 years 6 months ago
Linear approximations for rate control in video coding
An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows adva...
Yegnaswamy Sermadevi, Sheila S. Hemami
ICCS
2004
Springer
15 years 10 months ago
DisCAS: A Distributed-Parallel Computer Algebra System
The DisCAS system employs and interacts with multiple ELIMINOs distributed over the Internet to achieve a distributed-parallel computing environment. ELIMINO is a computer algebra ...
Yongwei Wu, Guangwen Yang, Weimin Zheng, Dongdai L...
EUROCRYPT
2006
Springer
15 years 8 months ago
VSH, an Efficient and Provable Collision-Resistant Hash Function
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
Scott Contini, Arjen K. Lenstra, Ron Steinfeld
INFOCOM
1995
IEEE
15 years 8 months ago
Automatic Alarm Correlation for Fault Identification
In communication networks, a large number of alarms exist to signal any abnormal behavior of the network. As network faults typically result in a number of alarms, correlating the...
Isabelle Rouvellou, George W. Hart