Sciweavers

520 search results - page 59 / 104
» Reductions Between Expansion Problems
Sort
View
JMLR
2010
143views more  JMLR 2010»
13 years 3 months ago
Regularized Discriminant Analysis, Ridge Regression and Beyond
Fisher linear discriminant analysis (FDA) and its kernel extension--kernel discriminant analysis (KDA)--are well known methods that consider dimensionality reduction and classific...
Zhihua Zhang, Guang Dai, Congfu Xu, Michael I. Jor...
CSB
2003
IEEE
150views Bioinformatics» more  CSB 2003»
14 years 2 months ago
Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
ERSA
2006
147views Hardware» more  ERSA 2006»
13 years 10 months ago
Code Partitioning for Reconfigurable High-Performance Computing: A Case Study
In this case study, various ways to partition a code between the microprocessor and FPGA are examined. Discrete image convolution operation with separable kernel is used as the ca...
Volodymyr V. Kindratenko
ISPD
2005
ACM
205views Hardware» more  ISPD 2005»
14 years 2 months ago
Coupling aware timing optimization and antenna avoidance in layer assignment
The sustained progress of VLSI technology has altered the landscape of routing which is a major physical design stage. For timing driven routings, traditional approaches which con...
Di Wu, Jiang Hu, Rabi N. Mahapatra
FSTTCS
1992
Springer
14 years 28 days ago
Structural Average Case Complexity
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
Rainer Schuler, Tomoyuki Yamakami