1640 search results - page 115 / 328 » Conditional Independence Trees |
149
Voted
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
— Existing stream processing systems are optimized for a specific metric, which may limit their applicability to diverse applications and environments. This paper presents XFlow...
145
click to vote
SIAMDM
2008
15 years 3 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
142
Voted
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...
164
Voted
TACAS
2010
Springer
15 years 10 months ago
2010
Springer
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
125
click to vote
IROS
2007
IEEE
15 years 9 months ago
2007
IEEE
— Intention recognition is an important topic in human-robot cooperation that can be tackled using probabilistic model-based methods. A popular instance of such methods are Bayes...