Sciweavers

2127 search results - page 300 / 426
» Computing large matchings fast
Sort
View
ICS
1993
Tsinghua U.
15 years 8 months ago
The EM-4 Under Implicit Parallelism
: The EM-4 is a supercomputer that offers very fast inter processor communication and support for multi threading. In this paper we demonstrate that the EM-4, Together with an auto...
Lubomir Bic, Mayez A. Al-Mouhamed
CTRSA
2006
Springer
183views Cryptology» more  CTRSA 2006»
15 years 7 months ago
Efficient Doubling on Genus 3 Curves over Binary Fields
The most important and expensive operation in a hyperelliptic curve cryptosystem (HECC) is scalar multiplication by an integer k, i.e., computing an integer k times a divisor D on ...
Xinxin Fan, Thomas J. Wollinger, Yumin Wang
ASPDAC
2010
ACM
155views Hardware» more  ASPDAC 2010»
15 years 2 months ago
Efficient model reduction of interconnects via double gramians approximation
The gramian approximation methods have been proposed recently to overcome the high computing costs of classical balanced truncation based reduction methods. But those methods typi...
Boyuan Yan, Sheldon X.-D. Tan, Gengsheng Chen, Yic...
DAWAK
2009
Springer
15 years 1 months ago
BitCube: A Bottom-Up Cubing Engineering
Enhancing on line analytical processing through efficient cube computation plays a key role in Data Warehouse management. Hashing, grouping and mining techniques are commonly used ...
Alfredo Ferro, Rosalba Giugno, Piera Laura Puglisi...
CVPR
2011
IEEE
14 years 11 months ago
Scene Flow Estimation by Growing Correspondence Seeds
A simple seed growing algorithm for estimating scene flow in a stereo setup is presented. Two calibrated and synchronized cameras observe a scene and output a sequence of image p...
Jan Cech, Jordi Sanchez-Riera, Radu Horaud