Sciweavers

2553 search results - page 128 / 511
» Modeling Trees with Hypertextures
Sort
View
FOCS
2006
IEEE
15 years 4 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys
CORR
2010
Springer
69views Education» more  CORR 2010»
14 years 10 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...
CORR
2010
Springer
109views Education» more  CORR 2010»
14 years 10 months ago
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
Rahul Jain, Hartmut Klauck, Miklos Santha
CAV
2009
Springer
134views Hardware» more  CAV 2009»
15 years 10 months ago
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
Alexander Wenner, Markus Müller-Olm, Peter La...
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
15 years 10 months ago
Extensible optimization in overlay dissemination trees
We introduce XPORT, a profile-driven distributed data dissemination system that supports an extensible set of data types, profile types, and optimization metrics. XPORT efficientl...
Olga Papaemmanouil, Yanif Ahmad, Ugur Çetin...