default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosé Bento 0001
Person information
- affiliation: Boston College, MA, USA
- affiliation (former): Stanford University, Electrical Engineering Department, CA, USA
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]José Bento
, Meysam Basiri, Rodrigo Ventura:
Information-Oriented and Energy-Aware Path Planning for Small Unmanned Aerial Vehicles. EPIA (3) 2024: 78-89- [c21]José Bento, Meysam Basiri, Rodrigo Ventura:
Information-Oriented and Energy-Aware Path Planning for Multiple Air-Dropped Small Unmanned Aerial Vehicles. ROBOT 2024: 1-8 - 2023
- [j8]Liang Mi, Azadeh Sheikholeslami, José Bento:
A family of pairwise multi-marginal optimal transports that define a generalized metric. Mach. Learn. 112(1): 353-384 (2023) - [c20]Jianxin Wang, José Bento:
Optimal Activation Functions for the Random Features Regression Model. ICLR 2023 - [i28]Minwook Kim, Juseong Kim, José Bento, Giltae Song:
Revisiting Self-Training with Regularized Pseudo-Labeling for Tabular Data. CoRR abs/2302.14013 (2023) - 2022
- [i27]Jianxin Wang, José Bento:
Optimal Activation Functions for the Random Features Regression Model. CoRR abs/2206.01332 (2022) - 2020
- [j7]Guilherme França, José Bento:
Distributed Optimization, Averaging via ADMM, and Network Topology. Proc. IEEE 108(11): 1939-1952 (2020) - [j6]Armin Moharrer, Jasmin Gao, Shikun Wang, José Bento, Stratis Ioannidis:
Massively Distributed Graph Distances. IEEE Trans. Signal Inf. Process. over Networks 6: 667-683 (2020) - [i26]Liang Mi, José Bento:
Multi-Marginal Optimal Transport Defines a Generalized Metric. CoRR abs/2001.11114 (2020) - [i25]Liang Mi, Tianshu Yu, José Bento, Wen Zhang, Baoxin Li, Yalin Wang:
Variational Wasserstein Barycenters for Geometric Clustering. CoRR abs/2002.10543 (2020) - [i24]Guilherme França, José Bento:
Distributed Optimization, Averaging via ADMM, and Network Topology. CoRR abs/2009.02604 (2020)
2010 – 2019
- 2019
- [j5]José Bento, Stratis Ioannidis:
A family of tractable graph metrics. Appl. Netw. Sci. 4(1): 107:1-107:27 (2019) - [c19]Sam Safavi, José Bento:
Tractable n-Metrics for Multiple Graphs. ICML 2019: 5568-5578 - [c18]Laurence Yang, Michael A. Saunders, Jean-Christophe Lachance, Bernhard O. Palsson, José Bento:
Estimating Cellular Goals from High-Dimensional Biological Data. KDD 2019: 2202-2211 - [i23]Surjyendu Ray, Bei Jia, Sam Safavi, Tim van Opijnen, Ralph Isberg, Jason Rosch, José Bento:
Exact inference under the perfect phylogeny model. CoRR abs/1908.08623 (2019) - 2018
- [j4]José Bento, Ralph Furmaniak, Surjyendu Ray:
On the Complexity of the Weighted Fused Lasso. IEEE Signal Process. Lett. 25(10): 1595-1599 (2018) - [c17]Sam Safavi, Bikash Joshi, Guilherme França, José Bento:
An Explicit Convergence Rate for Nesterov's Method from SDP. ISIT 2018: 1560-1564 - [c16]Bei Jia, Surjyendu Ray, Sam Safavi, José Bento:
Efficient Projection onto the Perfect Phylogeny Model. NeurIPS 2018: 4108-4118 - [c15]José Bento, Stratis Ioannidis:
A Family of Tractable Graph Distances. SDM 2018: 333-341 - [i22]José Bento, Stratis Ioannidis:
A Family of Tractable Graph Distances. CoRR abs/1801.04301 (2018) - [i21]Sam Safavi, Bikash Joshi, Guilherme França, José Bento:
An Explicit Convergence Rate for Nesterov's Method from SDP. CoRR abs/1801.04492 (2018) - [i20]José Bento, Surjyendu Ray:
On the Complexity of the Weighted Fussed Lasso. CoRR abs/1801.04987 (2018) - [i19]Sam Safavi, José Bento:
n-metrics for multiple graph alignment. CoRR abs/1807.03368 (2018) - [i18]Laurence Yang, José Bento, Jean-Christophe Lachance, Bernhard O. Palsson:
Genome-scale estimation of cellular objectives. CoRR abs/1807.04245 (2018) - [i17]Bei Jia, Surjyendu Ray, Sam Safavi, José Bento:
Efficient Projection onto the Perfect Phylogeny Model. CoRR abs/1811.01129 (2018) - 2017
- [j3]Guilherme França, José Bento:
Markov Chain Lifting and Distributed ADMM. IEEE Signal Process. Lett. 24(3): 294-298 (2017) - [i16]Jia-Jie Zhu, José Bento:
Generative Adversarial Active Learning. CoRR abs/1702.07956 (2017) - [i15]Guilherme França, José Bento:
Markov Chain Lifting and Distributed ADMM. CoRR abs/1703.03859 (2017) - 2016
- [j2]N. Ben-Zvi, José Bento, Moshe Mahler, Jessica K. Hodgins, Ariel Shamir:
Line-Drawing Video Stylization. Comput. Graph. Forum 35(6): 18-32 (2016) - [c14]Ning Hao, AmirReza Oghbaee, Mohammad Rostami, Nate Derbinsky, José Bento:
Testing Fine-Grained Parallelism for the ADMM on a Factor-Graph. IPDPS Workshops 2016: 835-844 - [c13]Guilherme França, José Bento:
An explicit rate bound for over-relaxed ADMM. ISIT 2016: 2104-2108 - [i14]José Bento:
A metric for sets of trajectories that is practical and mathematically consistent. CoRR abs/1601.03094 (2016) - [i13]Ning Hao, AmirReza Oghbaee, Mohammad Rostami, Nate Derbinsky, José Bento:
Testing fine-grained parallelism for the ADMM on a factor-graph. CoRR abs/1603.02526 (2016) - 2015
- [c12]Charles Mathy, Nate Derbinsky, José Bento, Jonathan Rosenthal, Jonathan S. Yedidia:
The Boundary Forest Algorithm for Online Supervised and Unsupervised Learning. AAAI 2015: 2864-2870 - [c11]José Bento, Nate Derbinsky, Charles Mathy, Jonathan S. Yedidia:
Proximal Operators for Multi-Agent Path Planning. AAAI 2015: 3657-3663 - [i12]José Bento, Nate Derbinsky, Charles Mathy, Jonathan S. Yedidia:
Proximal operators for multi-agent path planning. CoRR abs/1504.01783 (2015) - [i11]Charles Mathy, Nate Derbinsky, José Bento, Jonathan Rosenthal, Jonathan S. Yedidia:
The Boundary Forest Algorithm for Online Supervised and Unsupervised Learning. CoRR abs/1505.02867 (2015) - 2014
- [j1]José Bento Ayres Pereira, Morteza Ibrahimi:
Support Recovery for the Drift Coefficient of High-Dimensional Diffusions. IEEE Trans. Inf. Theory 60(7): 4026-4049 (2014) - [c10]Daniel Zoran, Dilip Krishnan, José Bento, Bill Freeman:
Shape and Illumination from Shading using the Generic Viewpoint Assumption. NIPS 2014: 226-234 - 2013
- [c9]Nate Derbinsky, José Bento, Jonathan S. Yedidia:
Methods for Integrating Knowledge with the Three-Weight Optimization Algorithm for Hybrid Cognitive Processing. AAAI Fall Symposia 2013 - [c8]José Bento, Nate Derbinsky, Javier Alonso-Mora, Jonathan S. Yedidia:
A message-passing algorithm for multi-agent trajectory planning. NIPS 2013: 521-529 - [c7]José Bento, Stratis Ioannidis, S. Muthukrishnan, Jinyun Yan:
A Time and Space Efficient Algorithm for Contextual Linear Bandits. ECML/PKDD (1) 2013: 257-272 - [i10]Nate Derbinsky, José Bento, Veit Elser, Jonathan S. Yedidia:
An Improved Three-Weight Message-Passing Algorithm. CoRR abs/1305.1961 (2013) - [i9]José Bento, Morteza Ibrahimi:
Support Recovery for the Drift Coefficient of High-Dimensional Diffusions. CoRR abs/1308.4077 (2013) - [i8]Nate Derbinsky, José Bento, Jonathan S. Yedidia:
Methods for Integrating Knowledge with the Three-Weight Optimization Algorithm for Hybrid Cognitive Processing. CoRR abs/1311.4064 (2013) - [i7]José Bento, Nate Derbinsky, Javier Alonso-Mora, Jonathan S. Yedidia:
A message-passing algorithm for multi-agent trajectory planning. CoRR abs/1311.4527 (2013) - 2012
- [c6]Niranjan Damera-Venkata, José Bento:
Ad insertion in automatically composed documents. ACM Symposium on Document Engineering 2012: 3-12 - [c5]José Bento, Stratis Ioannidis, S. Muthukrishnan, Jinyun Yan:
Group recommendations via multi-armed bandits. WWW (Companion Volume) 2012: 463-464 - [i6]José Bento, Stratis Ioannidis, S. Muthukrishnan, Jinyun Yan:
A Time and Space Efficient Algorithm for Contextual Linear Bandits. CoRR abs/1207.3024 (2012) - [i5]José Bento, Nadia Fawaz, Andrea Montanari, Stratis Ioannidis:
Identifying Users From Their Rating Patterns. CoRR abs/1207.6379 (2012) - 2011
- [c4]Niranjan Damera-Venkata, José Bento, Eamonn O'Brien-Strain:
Probabilistic document model for automated document composition. ACM Symposium on Document Engineering 2011: 3-12 - [c3]José Bento, Morteza Ibrahimi, Andrea Montanari:
Information theoretic limits on learning stochastic differential equations. ISIT 2011: 855-859 - [i4]José Bento, Morteza Ibrahimi, Andrea Montanari:
Information Theoretic Limits on Learning Stochastic Differential Equations. CoRR abs/1103.1689 (2011) - [i3]José Bento, Andrea Montanari:
On the trade-off between complexity and correlation decay in structural learning algorithms. CoRR abs/1110.1769 (2011) - 2010
- [c2]Mohsen Bayati, José Bento, Andrea Montanari:
The LASSO risk: asymptotic results and real world examples. NIPS 2010: 145-153 - [c1]José Bento, Morteza Ibrahimi, Andrea Montanari:
Learning Networks of Stochastic Differential Equations. NIPS 2010: 172-180 - [i2]José Bento, Morteza Ibrahimi, Andrea Montanari:
Learning Networks of Stochastic Differential Equations. CoRR abs/1011.0415 (2010)
2000 – 2009
- 2009
- [i1]José Bento, Andrea Montanari:
Which graphical models are difficult to learn? CoRR abs/0910.5761 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
