Sciweavers

4865 search results - page 592 / 973
» The Complexity of Graph Connectivity
Sort
View
JSYML
2006
76views more  JSYML 2006»
15 years 6 months ago
Diagonal actions and Borel equivalence relations
We investigate diagonal actions of Polish groups and the related intersection operator on closed subgroups of the acting group. The Borelness of the diagonal orbit equivalence rela...
Longyun Ding, Su Gao
ENTCS
2002
103views more  ENTCS 2002»
15 years 6 months ago
Deciding low levels of tree-automata hierarchy
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
Igor Walukiewicz
ICRA
2010
IEEE
189views Robotics» more  ICRA 2010»
15 years 4 months ago
Discovering and mapping complete surfaces with stereo
This paper is about the automated discovery and mapping of surfaces using a stereo pair. We begin with the observation that for any workspace which is topologically connected (i.e....
Robert Shade, Paul Newman
OL
2011
277views Neural Networks» more  OL 2011»
15 years 1 months ago
An exact algorithm for minimum CDS with shortest path constraint in wireless networks
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
JMLR
2012
13 years 9 months ago
Adaptive MCMC with Bayesian Optimization
This paper proposes a new randomized strategy for adaptive MCMC using Bayesian optimization. This approach applies to nondifferentiable objective functions and trades off explor...
Nimalan Mahendran, Ziyu Wang, Firas Hamze, Nando d...