Sciweavers

27 search results - page 4 / 6
» Montgomery Exponentiation with no Final Subtractions: Improv...
Sort
View
COMPSAC
2003
IEEE
15 years 2 months ago
A Cut-Based Algorithm for Reliability Analysis of Terminal-Pair Network Using OBDD
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
Yung-Ruei Chang, Hung-Yau Lin, Ing-Yi Chen, Sy-Yen...
ASPDAC
1999
ACM
137views Hardware» more  ASPDAC 1999»
15 years 1 months ago
A Performance-Driven I/O Pin Routing Algorithm
This paper presents a performance-driven I/O pin routing algorithm with special consideration of wire uniformity. First, a topological routing based on min-cost max-flow algorith...
Dongsheng Wang, Ping Zhang, Chung-Kuan Cheng, Arun...
IOR
2010
71views more  IOR 2010»
14 years 6 months ago
Stochastic Root Finding and Efficient Estimation of Convex Risk Measures
Reliable risk measurement is a key problem for financial institutions and regulatory authorities. The current industry standard Value-at-Risk has several deficiencies. Improved ri...
Jörn Dunkel, Stefan Weber
SIGIR
2000
ACM
15 years 1 months ago
Hill climbing algorithms for content-based retrieval of similar configurations
The retrieval of stored images matching an input configuration is an important form of content-based retrieval. Exhaustive processing (i.e., retrieval of the best solutions) of co...
Dimitris Papadias
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 1 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...