58 search results - page 8 / 12 » Inclusion Constraints over Non-empty Sets of Trees |
ICDCS
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
101
click to vote
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
We present an overview of the Jahob system for modular analysis of data structure properties. Jahob uses a subset of Java as the implementation language and annotations with formu...
108
click to vote
BMCBI
2004
14 years 11 months ago
2004
Background: Alignment and comparison of related genome sequences is a powerful method to identify regions likely to contain functional elements. Such analyses are data intensive, ...
100
click to vote
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
ICML
2004
IEEE
16 years 13 days ago
2004
IEEE
We present an algorithmic framework for supervised classification learning where the set of labels is organized in a predefined hierarchical structure. This structure is encoded b...