2612 search results - page 251 / 523 » Switching Graphs and Their Complexity |
186
click to vote
PODC
2010
ACM
15 years 9 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
180
click to vote
DILS
2006
Springer
15 years 9 months ago
2006
Springer
The Open Biomedical Ontologies (OBO) is a consortium that serves as a repository of ontologies that are structured like directed acyclic graphs. In this paper we present a language...
170
click to vote
NIPS
2008
15 years 7 months ago
2008
In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. These representa...
158
click to vote
FLAIRS
2006
15 years 7 months ago
2006
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
146
click to vote
IJCAI
2001
15 years 7 months ago
2001
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...