268 search results - page 41 / 54 » Cleaning Interval Graphs |
UAI
2004
14 years 11 months ago
2004
Classical learning assumes the learner is given a labeled data sample, from which it learns a model. The field of Active Learning deals with the situation where the learner begins...
165
click to vote
GIS
2008
ACM
15 years 11 months ago
2008
ACM
Network data models are widely used to describe the connectivity between spatial features in GIS architectures. Recent applications demand that such models are editable in multius...
VMCAI
2010
Springer
15 years 7 months ago
2010
Springer
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...
FSEN
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
WG
2005
Springer
15 years 3 months ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...