Sciweavers

2634 search results - page 12 / 527
» Faster Than Uppaal
Sort
View
ACL
2010
13 years 5 months ago
Faster Parsing by Supertagger Adaptation
We propose a novel self-training method for a parser which uses a lexicalised grammar and supertagger, focusing on increasing the speed of the parser rather than its accuracy. The...
Jonathan K. Kummerfeld, Jessika Roesner, Tim Dawbo...
TC
2010
13 years 2 months ago
Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...
Miroslav Knezevic, Frederik Vercauteren, Ingrid Ve...
IACR
2011
114views more  IACR 2011»
12 years 7 months ago
Faster Scalar Multiplication on Ordinary Weierstrass Elliptic Curves over Fields of Characteristic Three
Abstract. This paper proposes new explicit formulae for the point doubling, tripling and addition on ordinary Weierstrass elliptic curves with a point of order 3 over finite fiel...
Hongfeng Wu, Changan Zhao
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
14 years 2 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
14 years 1 months ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan