6266 search results - page 1196 / 1254 » New results on the computability and complexity of points - ... |
BMCBI
2008
13 years 7 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
KBSE
2005
IEEE
14 years 1 months ago
2005
IEEE
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
ICCAD
2004
IEEE
14 years 4 months ago
2004
IEEE
—In this paper, we present a new block budgeting algorithm which speeds up timing closure in timing driven hierarchical flows. After a brief description of the addressed flow, ...