8 citations · 8 across the 1 of their papers we have counts for
3 papers
cs.DC2016
Testing fine-grained parallelism for the ADMM on a factor-graph
Ning Hao, AmirReza Oghbaee, Mohammad Rostami +2
There is an ongoing effort to develop tools that apply distributed computational resources to tackle large problems or reduce the time to solve them. In this context, the Alternati…
cs.LG2015★ 8 cited
The Boundary Forest Algorithm for Online Supervised and Unsupervised Learning
Charles Mathy, Nate Derbinsky, José Bento +2
We describe a new instance-based learning algorithm called the Boundary Forest (BF) algorithm, that can be used for supervised and unsupervised learning. The algorithm builds a for…
cs.RO2015
Proximal operators for multi-agent path planning
José Bento, Nate Derbinsky, Charles Mathy +1
We address the problem of planning collision-free paths for multiple agents using optimization methods known as proximal algorithms. Recently this approach was explored in Bento et…