default search action
Tibério S. Caetano
Person information
- affiliation: Australian National University, Research School of Computer Science
- affiliation: NICTA, Machine Learning Group
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [i17]Daniel Steinberg, Alistair Reid, Simon O'Callaghan, Finnian Lattimore, Lachlan McCalman, Tibério S. Caetano:
Fast Fair Regression via Efficient Approximations of Mutual Information. CoRR abs/2002.06200 (2020)
2010 – 2019
- 2018
- [j15]Pengdong Xiao
, Nick Barnes
3-D Shape Matching and Non-Rigid Correspondence for Hippocampi Based on Markov Random Fields. IEEE Trans. Image Process. 27(3): 1271-1281 (2018) - 2017
- [r2]Julian J. McAuley, Tibério S. Caetano, Wray L. Buntine:
Graphical Models. Encyclopedia of Machine Learning and Data Mining 2017: 584-592 - 2016
- [c36]Giorgio Patrini, Richard Nock, Stephen Hardy, Tibério S. Caetano:
Fast Learning from Distributed Datasets without Entity Matching. IJCAI 2016: 1909-1917 - [c35]Marian-Andrei Rizoiu
Evolution of Privacy Loss in Wikipedia. WSDM 2016: 215-224 - [i16]Giorgio Patrini, Richard Nock, Stephen Hardy, Tibério S. Caetano:
Fast Learning from Distributed Datasets without Entity Matching. CoRR abs/1603.04002 (2016) - [i15]Richard Nock, Giorgio Patrini, Finnian Lattimore, Tibério S. Caetano:
The Crossover Process: Learnability meets Protection from Inference Attacks. CoRR abs/1606.04160 (2016) - 2015
- [j14]Qinfeng Shi
A Hybrid Loss for Multiclass and Structured Prediction. IEEE Trans. Pattern Anal. Mach. Intell. 37(1): 2-12 (2015) - [i14]Marian-Andrei Rizoiu
Evolution of Privacy Loss in Wikipedia. CoRR abs/1512.03523 (2015) - 2014
- [c34]Aaron Defazio, Justin Domke, Tibério S. Caetano:
Finito: A faster, permutable incremental gradient method for big data problems. ICML 2014: 1125-1133 - [c33]Giorgio Patrini, Richard Nock, Tibério S. Caetano, Paul Rivera:
(Almost) No Label No Cry. NIPS 2014: 190-198 - [c32]Xianghang Liu, Xinhua Zhang, Tibério S. Caetano:
Bayesian Models for Structured Sparse Estimation via Set Cover Prior. ECML/PKDD (2) 2014: 273-289 - [i13]Qinfeng Shi, Mark D. Reid, Tibério S. Caetano, Anton van den Hengel, Zhenhua Wang:
A Hybrid Loss for Multiclass and Structured Prediction. CoRR abs/1402.1921 (2014) - [i12]Aaron J. Defazio, Tibério S. Caetano:
A Convex Formulation for Learning Scale-Free Networks via Submodular Relaxation. CoRR abs/1407.2697 (2014) - [i11]Aaron J. Defazio, Tibério S. Caetano, Justin Domke:
Finito: A Faster, Permutable Incremental Gradient Method for Big Data Problems. CoRR abs/1407.2710 (2014) - 2013
- [j13]Ilana Lichtenstein, Michael A. Charleston
Active Subnetwork Recovery with a Mechanism-Dependent Scoring Function; with application to Angiogenesis and Organogenesis studies. BMC Bioinform. 14: 59 (2013) - [j12]Julian J. McAuley, Arnau Ramisa, Tibério S. Caetano:
Optimization of Robust Loss Functions for Weakly-Labeled Image Taxonomies. Int. J. Comput. Vis. 104(3): 343-361 (2013) - 2012
- [j11]Nick Barnes, Peter Baumgartner, Tibério S. Caetano, Hugh F. Durrant-Whyte, Gerwin Klein, Penelope Sanderson, Abdul Sattar, Peter J. Stuckey, Sylvie Thiébaux, Pascal Van Hentenryck, Toby Walsh:
AI@NICTA. AI Mag. 33(3): 115- (2012) - [j10]Julian J. McAuley, Tibério S. Caetano:
Fast matching of large point sets under occlusions. Pattern Recognit. 45(1): 563-569 (2012) - [j9]Junbin Gao
Dimensionality reduction via compressive sensing. Pattern Recognit. Lett. 33(9): 1163-1170 (2012) - [c31]Aaron Defazio, Tibério S. Caetano:
A Graphical Model Formulation of Collaborative Filtering Neighbourhood Methods with Fast Maximum Entropy Training. ICML 2012 - [c30]Tibério S. Caetano:
The Interplay of Statistical and Structural Pattern Recognition from a Machine Learning Perspective. ICPRAM (1) 2012 - [c29]Aaron Defazio, Tibério S. Caetano:
A Convex Formulation for Learning Scale-Free Networks via Submodular Relaxation. NIPS 2012: 1259-1267 - [c28]Xianghang Liu, James Petterson, Tibério S. Caetano:
Learning as MAP Inference in Discrete Graphical Models. NIPS 2012: 1979-1987 - [i10]Aaron Defazio, Tibério S. Caetano:
A Graphical Model Formulation of Collaborative Filtering Neighbourhood Methods with Fast Maximum Entropy Training. CoRR abs/1206.4622 (2012) - 2011
- [j8]Julian J. McAuley, Tibério S. Caetano:
Faster Algorithms for Max-Product Message-Passing. J. Mach. Learn. Res. 12: 1349-1388 (2011) - [c27]Julian J. McAuley, Arnau Ramisa, Tibério S. Caetano:
Optimization of Robust Loss Functions for Weakly-Labeled Image Taxonomies: An ImageNet Case Study. EMMCVPR 2011: 355-368 - [c26]James Petterson, Tibério S. Caetano:
Submodular Multi-Label Learning. NIPS 2011: 1512-1520 - 2010
- [c25]Julian J. McAuley, Teofilo de Campos
Unified graph matching in Euclidean spaces. CVPR 2010: 1871-1878 - [c24]Pengdong Xiao, Nick Barnes, Paulette Lieby, Tibério S. Caetano:
Sparse Update for Loopy Belief Propagation: Fast Dense Registration for Large State Spaces. DICTA 2010: 546-551 - [c23]Julian J. McAuley, Tibério S. Caetano:
Exploiting Data-Independence for Fast Belief-Propagation. ICML 2010: 767-774 - [c22]James Petterson, Tibério S. Caetano:
Reverse Multi-Label Learning. NIPS 2010: 1912-1920 - [c21]James Petterson, Alexander J. Smola, Tibério S. Caetano, Wray L. Buntine, Shravan M. Narayanamurthy:
Word Features for Latent Dirichlet Allocation. NIPS 2010: 1921-1929 - [c20]Novi Quadrianto, Alexander J. Smola, Tibério S. Caetano, S. V. N. Vishwanathan, James Petterson:
Multitask Learning without Label Correspondences. NIPS 2010: 1957-1965 - [c19]Julian J. McAuley, Tibério S. Caetano:
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms. AISTATS 2010: 525-532 - [r1]Julian J. McAuley, Tibério S. Caetano, Wray L. Buntine:
Graphical Models. Encyclopedia of Machine Learning 2010: 471-479 - [i9]Qinfeng Shi, Mark D. Reid, Tibério S. Caetano:
Conditional Random Fields and Support Vector Machines: A Hybrid Approach. CoRR abs/1009.3346 (2010)
2000 – 2009
- 2009
- [j7]Novi Quadrianto, Alexander J. Smola, Tibério S. Caetano, Quoc V. Le:
Estimating Labels from Label Proportions. J. Mach. Learn. Res. 10: 2349-2374 (2009) - [j6]Tibério S. Caetano, Julian J. McAuley, Li Cheng
Learning Graph Matching. IEEE Trans. Pattern Anal. Mach. Intell. 31(6): 1048-1058 (2009) - [c18]Longbin Chen, Julian J. McAuley
Shape classification through structured learning of matching measures. CVPR 2009: 365-372 - [c17]Pengdong Xiao, Nick Barnes, Paulette Lieby, Tibério S. Caetano:
Applying Sum and Max Product Algorithms of Belief Propagation to 3D Shape Matching and Registration. DICTA 2009: 387-394 - [c16]Novi Quadrianto
Kernel Conditional Quantile Estimation via Reduction Revisited. ICDM 2009: 938-943 - [c15]James Petterson, Tibério S. Caetano, Julian J. McAuley, Jin Yu:
Exponential Family Graph Matching and Ranking. NIPS 2009: 1455-1463 - [c14]Novi Quadrianto, Tibério S. Caetano, John Lim, Dale Schuurmans:
Convex Relaxation of Mixture Regression with Efficient Algorithms. NIPS 2009: 1491-1499 - [i8]James Petterson, Tibério S. Caetano, Julian J. McAuley, Jin Yu:
Exponential Family Graph Matching and Ranking. CoRR abs/0904.2623 (2009) - [i7]James Petterson, Tibério S. Caetano:
Scalable Inference for Latent Dirichlet Allocation. CoRR abs/0909.4603 (2009) - [i6]Julian J. McAuley, Tibério S. Caetano:
Exact Inference in Graphical Models: is There More to it? CoRR abs/0910.3301 (2009) - [i5]Julian J. McAuley, Tibério S. Caetano:
An expected-case sub-cubic solution to the all-pairs shortest path problem in R. CoRR abs/0912.0975 (2009) - 2008
- [j5]Julian J. McAuley, Tibério S. Caetano, Marconi S. Barbosa:
Graph Rigidity, Cyclic Belief Propagation, and Point Pattern Matching. IEEE Trans. Pattern Anal. Mach. Intell. 30(11): 2047-2054 (2008) - [c13]Novi Quadrianto
Estimating labels from label proportions. ICML 2008: 776-783 - [c12]Julian J. McAuley, Tibério S. Caetano, Alexander J. Smola:
Robust Near-Isometric Matching via Structured Learning of Graphical Models. NIPS 2008: 1057-1064 - [i4]Tibério S. Caetano, Julian J. McAuley, Li Cheng, Quoc V. Le, Alexander J. Smola:
Learning Graph Matching. CoRR abs/0806.2890 (2008) - [i3]Julian J. McAuley, Tibério S. Caetano, Alexander J. Smola:
Robust Near-Isometric Matching via Structured Learning of Graphical Models. CoRR abs/0809.3618 (2008) - 2007
- [c11]Pengdong Xiao, Nick Barnes, Tibério S. Caetano, Paulette Lieby:
An MRF and Gaussian Curvature Based Shape Representation for Shape Matching. CVPR 2007 - [c10]Tibério S. Caetano, Li Cheng
Learning Graph Matching. ICCV 2007: 1-8 - [i2]Julian J. McAuley, Tibério S. Caetano, Marconi S. Barbosa:
Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching. CoRR abs/0710.0043 (2007) - [i1]Julian John McAuley, Tibério S. Caetano:
High-Order Nonparametric Belief-Propagation for Fast Image Inpainting. CoRR abs/0710.0243 (2007) - 2006
- [j4]Tibério S. Caetano, Terry Caelli
Graphical Models and Point Pattern Matching. IEEE Trans. Pattern Anal. Mach. Intell. 28(10): 1646-1663 (2006) - [j3]Tibério S. Caetano, Terry Caelli
Approximating the problem, not the solution: An alternative view of point set matching. Pattern Recognit. 39(4): 552-561 (2006) - [c9]Julian J. McAuley, Tibério S. Caetano, Alexander J. Smola, Matthias O. Franz:
Learning high-order MRF priors of color images. ICML 2006: 617-624 - [c8]Tibério S. Caetano, Terry Caelli
A Unified Formulation of Invariant Point Pattern Matching. ICPR (3) 2006: 121-124 - [c7]Olivier Y. de Vel, Nianjun Liu, Terry Caelli, Tibério S. Caetano:
An Embedded Bayesian Network Hidden Markov Model for Digital Forensics. ISI 2006: 459-465 - 2005
- [j2]Terry Caelli
Graphical models for graph matching: Approximate models and optimal algorithms. Pattern Recognit. Lett. 26(3): 339-346 (2005) - [c6]Tibério S. Caetano, Terry Caelli:
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching. GbRPR 2005: 233-242 - 2004
- [b1]Tibério S. Caetano:
Modelos Gráficos e Casamento de Padrões de Pontos. Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil, 2004 - [c5]Tibério S. Caetano, Terry Caelli, Dante Augusto Couto Barone:
Graphical Models for Graph Matching. CVPR (2) 2004: 466-473 - [c4]Tibério S. Caetano, Terry Caelli, Dante Augusto Couto Barone:
A Comparison of Junction Tree and Relaxation Algorithms for Point Matching using Different Distance Metrics. ICPR (2) 2004: 124-127 - [c3]Tibério S. Caetano, Terry Caelli, Dante Augusto Couto Barone:
An Optimal Probabilistic Graphical Model for Point Set Matching. SSPR/SPR 2004: 162-170 - 2003
- [j1]Tibério S. Caetano, Sílvia D. Olabarriaga, Dante Augusto Couto Barone:
Do mixture models in chromaticity space improve skin detection? Pattern Recognit. 36(12): 3019-3021 (2003) - 2002
- [c2]Tibério S. Caetano, Sílvia D. Olabarriaga, Dante Augusto Couto Barone:
Performance Evaluation of Single and Multiple-Gaussian Models for Skin Color Modeling. SIBGRAPI 2002: 275-282 - 2001
- [c1]Tibério S. Caetano, Dante Augusto Couto Barone:
A Probabilistic Model for the Human Skin Color. ICIAP 2001: 279-283
Coauthor Index
aka: Julian John McAuley
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 2024-07-23 00:34 CEST 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: