Sciweavers

1066 search results - page 77 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
DATE
2007
IEEE
130views Hardware» more  DATE 2007»
15 years 4 months ago
A novel criticality computation method in statistical timing analysis
Abstract— The impact of process variations increases as technology scales to nanometer region. Under large process variations, the path and arc/node criticality [18] provide effe...
Feng Wang 0004, Yuan Xie, Hai Ju
ICIP
2003
IEEE
15 years 3 months ago
K-Voronoi diagrams computing in arbitrary domains
We propose a novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains. The algorithm is based on a fast ordered propagation distance transformation ca...
Rubén Cárdenes, Simon K. Warfield, A...
AAAI
2010
14 years 11 months ago
Conformal Mapping by Computationally Efficient Methods
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
Stefan Pintilie, Ali Ghodsi
ICASSP
2011
IEEE
14 years 1 months ago
Sparse common spatial patterns in brain computer interface applications
The Common Spatial Pattern (CSP) method is a powerful technique for feature extraction from multichannel neural activity and widely used in brain computer interface (BCI) applicat...
Fikri Goksu, Nuri Firat Ince, Ahmed H. Tewfik
SRDS
2010
IEEE
14 years 7 months ago
A Cooperative Sampling Approach to Discovering Optimal Configurations in Large Scale Computing Systems
With the growing scale of current computing systems, traditional configuration tuning methods become less effective because they usually assume a small number of parameters in the...
Haifeng Chen, Guofei Jiang, Hui Zhang 0002, Kenji ...