3110 search results - page 548 / 622 » On the initialization of the DNMF algorithm |
166
click to vote
SWAT
1992
Springer
15 years 8 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
112
click to vote
COCO
2010
Springer
15 years 8 months ago
2010
Springer
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
250
click to vote
BIBE
2004
IEEE
15 years 8 months ago
2004
IEEE
As the capture and analysis of single-time-point microarray expression data becomes routine, investigators are turning to time-series expression data to investigate complex gene r...
145
click to vote
PLDI
1995
ACM
15 years 8 months ago
1995
ACM
We present a unified approach to locality optimization that employs both data and control transformations. Data transformations include changing the array layout in memory. Contr...
142
click to vote
ASMTA
2008
Springer
15 years 6 months ago
2008
Springer
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...