Sciweavers

730 search results - page 48 / 146
» Faster dimension reduction
Sort
View
WEA
2010
Springer
280views Algorithms» more  WEA 2010»
14 years 3 months ago
Practical Nearest Neighbor Search in the Plane
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
Michael Connor, Piyush Kumar
ICCD
2004
IEEE
100views Hardware» more  ICCD 2004»
14 years 5 months ago
Thermal-Aware Clustered Microarchitectures
As frequencies and feature size scale faster than operating voltages, power density is increasing in each processor generation. Power density and the cost of removing the heat it ...
Pedro Chaparro, José González, Anton...
DAC
2003
ACM
14 years 1 months ago
Realizable RLCK circuit crunching
Reduction of an extracted netlist is an important pre-processing step for techniques such as model order reduction in the design and analysis of VLSI circuits. This paper describe...
Chirayu S. Amin, Masud H. Chowdhury, Yehea I. Isma...
CHES
2004
Springer
128views Cryptology» more  CHES 2004»
14 years 2 months ago
Long Modular Multiplication for Cryptographic Applications
Abstract. A digit-serial, multiplier-accumulator based cryptographic coprocessor architecture is proposed, similar to fix-point DSP's with enhancements, supporting long modula...
Laszlo Hars
WSC
2007
13 years 11 months ago
A method for fast generation of bivariate Poisson random vectors
It is well known that trivariate reduction — a method to generate two dependent random variables from three independent random variables — can be used to generate Poisson rand...
Kaeyoung Shin, Raghu Pasupathy