Sciweavers

680 search results - page 8 / 136
» A randomized embedding algorithm for trees
Sort
View
IPPS
1998
IEEE
13 years 11 months ago
Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
Anders Dessmark, Carsten Dorgerloh, Andrzej Lingas...
IROS
2008
IEEE
165views Robotics» more  IROS 2008»
14 years 1 months ago
Probabilistic navigation in dynamic environment using Rapidly-exploring Random Trees and Gaussian processes
— The paper describes a navigation algorithm for dynamic, uncertain environment. Moving obstacles are supposed to move on typical patterns which are pre-learned and are represent...
Chiara Fulgenzi, Christopher Tay, Anne Spalanzani,...
WAIM
2009
Springer
14 years 2 months ago
Finding Irredundant Contained Rewritings of Tree Pattern Queries Using Views
Contained rewriting and maximal contained rewriting of tree pattern queries using views have been studied recently for the class of tree patterns involving /, //, and []. Given que...
Junhu Wang, Kewen Wang, Jiuyong Li
CORR
2011
Springer
165views Education» more  CORR 2011»
13 years 2 months ago
Causal Dependence Tree Approximations of Joint Distributions for Multiple Random Processes
—We investigate approximating joint distributions of random processes with causal dependence tree distributions. Such distributions are particularly useful in providing parsimoni...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
13 years 12 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...