2229 search results - page 301 / 446 » Comparative analysis of biclustering algorithms |
ICCAD
1999
IEEE
14 years 2 months ago
1999
IEEE
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
ICDE
2010
IEEE
14 years 2 months ago
2010
IEEE
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
ATVA
2006
Springer
14 years 2 months ago
2006
Springer
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
EVOW
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. The increased availability of biological databases containing representations of complex objects permits access to vast amounts of data. In spite of the recent renewed in...
CIKM
2008
Springer
14 years 5 days ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...