Sciweavers

968 search results - page 3 / 194
» A faster implementation of APlace
Sort
View
IACR
2011
136views more  IACR 2011»
12 years 7 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
DAC
2007
ACM
14 years 8 months ago
RQL: Global Placement via Relaxed Quadratic Spreading and Linearization
This paper describes a simple and effective quadratic placement algorithm called RQL. We show that a good quadratic placement, followed by local wirelength-driven spreading can pr...
Natarajan Viswanathan, Gi-Joon Nam, Charles J. Alp...
BMCBI
2011
12 years 11 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
ICTAI
2010
IEEE
13 years 5 months ago
PKOPT: Faster k-Optimal Solution for DCOP by Improving Group Selection Strategy
A significant body of work in multiagent systems over more than two decades has focused on multi-agent coordination (1). Many challenges in multi-agent coordination can be modeled ...
Elnaz Bigdeli, Maryam Rahmaninia, Mohsen Afsharchi
IJCAT
2010
273views more  IJCAT 2010»
13 years 5 months ago
FPGA implementation of log-polar mapping
Log-polar or spatially-variant image representation is an important component of active vision system in tracking process for many robotic applications due to its data compression ...
Wai Kit Wong, Chee Wee Choo, Chu Kiong Loo, Joo Pe...