Sciweavers

681 search results - page 93 / 137
» General Polynomial Time Decomposition Algorithms
Sort
View
CVPR
2009
IEEE
14 years 2 months ago
Nonlinear Nonnegative Component Analysis
In this paper general solutions for Nonlinear Nonnegative Component Analysis for data representation and recognition are proposed. That is, motivated by a combination of the Nonne...
Stefanos Zafeiriou, Maria Petrou
SPAA
2006
ACM
14 years 5 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
DAC
2006
ACM
14 years 12 months ago
Stochastic variational analysis of large power grids considering intra-die correlations
For statistical timing and power analysis that are very important problems in the sub-100nm technologies, stochastic analysis of power grids that characterizes the voltage fluctua...
Praveen Ghanta, Sarma B. K. Vrudhula, Sarvesh Bhar...
DAC
2001
ACM
14 years 12 months ago
Factoring and Recognition of Read-Once Functions using Cographs and Normality
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
Martin Charles Golumbic, Aviad Mintz, Udi Rotics
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
14 years 11 months ago
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dr...