3110 search results - page 113 / 622 » On the initialization of the DNMF algorithm |
168
click to vote
CVPR
2004
IEEE
16 years 7 months ago
2004
IEEE
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
262
click to vote
ICDE
2004
IEEE
16 years 6 months ago
2004
IEEE
Real datasets are often large enough to necessitate data compression. Traditional `syntactic' data compression methods treat the table as a large byte string and operate at t...
112
click to vote
ICCAD
2007
IEEE
16 years 1 months ago
2007
IEEE
— The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the prob...
150
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
148
click to vote
DASFAA
2006
IEEE
15 years 11 months ago
2006
IEEE
The DTD of a set of XML documents may change due to many reasons such as changes to the real world events, changes to the user’s requirements, and mistakes in the initial design....