Sciweavers

264 search results - page 24 / 53
» On the possibility of faster SAT algorithms
Sort
View
96
Voted
ITNG
2007
IEEE
15 years 4 months ago
SPA resistant Elliptic Curve Cryptosystem using Addition Chains
: There has been a lot of interest in recent years in the problems faced by cryptosystems due to side channel attacks. Algorithms for elliptic curve point scalar multiplication suc...
Andrew Byrne, Nicolas Meloni, Francis M. Crowe, Wi...
76
Voted
ARITH
1999
IEEE
15 years 2 months ago
Multiplications of Floating Point Expansions
In modern computers, the floating point unit is the part of the processor delivering the highest computing power and getting most attention from the design team. Performance of an...
Marc Daumas
81
Voted
ACL
2006
14 years 11 months ago
Efficient Sentence Retrieval Based on Syntactic Structure
This paper proposes an efficient method of sentence retrieval based on syntactic structure. Collins proposed Tree Kernel to calculate structural similarity. However, structual ret...
Hiroshi Ichikawa, Keita Hakoda, Taiichi Hashimoto,...
89
Voted
IANDC
2008
80views more  IANDC 2008»
14 years 10 months ago
Preemptive scheduling on a small number of hierarchical machines
We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In t...
György Dósa, Leah Epstein
TCS
2008
14 years 10 months ago
On-line construction of compact suffix vectors and maximal repeats
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
Élise Prieur, Thierry Lecroq