Sciweavers

882 search results - page 123 / 177
» On self-embeddings of computable linear orderings
Sort
View
SETA
2004
Springer
122views Mathematics» more  SETA 2004»
15 years 6 months ago
New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
Kenneth J. Giuliani, Guang Gong
SC
1995
ACM
15 years 4 months ago
Parallel Matrix-Vector Product Using Approximate Hierarchical Methods
Matrix-vector products (mat-vecs) form the core of iterative methods used for solving dense linear systems. Often, these systems arise in the solution of integral equations used i...
Ananth Grama, Vipin Kumar, Ahmed H. Sameh
107
Voted
CAD
2006
Springer
15 years 19 days ago
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
Stephane Redon, Ming C. Lin
PC
2010
196views Management» more  PC 2010»
14 years 11 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak
CVPR
2007
IEEE
16 years 2 months ago
Face Re-Lighting from a Single Image under Harsh Lighting Conditions
In this paper, we present a new method to change the illumination condition of a face image, with unknown face geometry and albedo information. This problem is particularly diffic...
Yang Wang, Zicheng Liu, Gang Hua, Zhen Wen, Zhengy...