◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Nate Derbinsky

6 papers hereh-index 12423 citations43 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2
  • middle author4

Across the 6 of 6 papers where every author was matched, so the position is known.

fields
  • cs.AI3
  • cs.DC1
  • cs.LG1
  • cs.RO1

identity via Semantic Scholar / OpenAlex

activity
20132016
most citedAn Improved Three-Weight Message-Passing Algorithm

32 citations · 56 across the 5 of their papers we have counts for

collaborators
Showing 2015Show all

2 papers · 1 filter

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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.