Sciweavers

8728 search results - page 134 / 1746
» On Reduct Construction Algorithms
Sort
View
116
Voted
JCPHY
2011
109views more  JCPHY 2011»
14 years 3 months ago
Fast construction of hierarchical matrix representation from matrix-vector multiplication
We develop a hierarchical matrix construction algorithm using matrixvector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorith...
Lin Lin, Jianfeng Lu, Lexing Ying
COMPGEOM
2009
ACM
15 years 7 months ago
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
Jean-Daniel Boissonnat, Olivier Devillers, Samuel ...
ICGI
1994
Springer
15 years 5 months ago
Computer Assisted Grammar Construction
: This paper proposes a new inference approach for Chinese probabilistic context-free grammar, which implements the EM algorithm based on the bracket matching schemes. By utilizing...
S. J. Young, H.-H. Shih
131
Voted
CRYPTO
2011
Springer
191views Cryptology» more  CRYPTO 2011»
14 years 19 days ago
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
ASIACRYPT
2004
Springer
15 years 6 months ago
Masking Based Domain Extenders for UOWHFs: Bounds and Constructions
We study the class of masking based domain extenders for UOWHFs. Our first contribution is to show that any correct masking based domain extender for UOWHF which invokes the compr...
Palash Sarkar