711 search results - page 142 / 143 » Matching Hierarchical Structures Using Association Graphs |
DAC
2002
ACM
14 years 8 months ago
2002
ACM
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...
GECCO
2004
Springer
14 years 26 days ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
AI
2007
Springer
13 years 7 months ago
2007
Springer
In this paper, we model multi-agent events in terms of a temporally varying sequence of sub-events, and propose a novel approach for learning, detecting and representing events in...
BMCBI
2006
13 years 7 months ago
2006
Background: With the completion of the genome sequences of human, mouse, and other species and the advent of high throughput functional genomic research technologies such as biomi...
BMCBI
2006
13 years 7 months ago
2006
Background: With the advent of high-throughput proteomic experiments such as arrays of purified proteins comes the need to analyse sets of proteins as an ensemble, as opposed to t...