default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Broecheler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j3]Stephen H. Bach, Matthias Broecheler, Bert Huang, Lise Getoor:
Hinge-Loss Markov Random Fields and Probabilistic Soft Logic. J. Mach. Learn. Res. 18: 109:1-109:67 (2017)- 2015
- [i2]Stephen H. Bach, Matthias Broecheler, Bert Huang, Lise Getoor:
Hinge-Loss Markov Random Fields and Probabilistic Soft Logic. CoRR abs/1505.04406 (2015) - 2014
- [j2]Andrea Pugliese
, Matthias Bröcheler, V. S. Subrahmanian, Michael Ovelgönne:
Efficient Multiview Maintenance under Insertion in Huge Social Networks. ACM Trans. Web 8(2): 10:1-10:32 (2014) - [r1]Matthias Bröcheler, Andrea Pugliese, V. S. Subrahmanian:
Scaling Subgraph Matching Queries in Huge Networks. Encyclopedia of Social Network Analysis and Mining 2014: 1626-1643 - 2013
- [j1]Paulo Shakarian, Matthias Broecheler, V. S. Subrahmanian, Cristian Molinaro:
Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems. ACM Trans. Comput. Log. 14(2): 10:1-10:40 (2013) - 2012
- [c12]Stephen H. Bach, Matthias Broecheler, Lise Getoor, Dianne P. O'Leary:
Scaling MPE Inference for Constrained Continuous Markov Random Fields with Consensus Optimization. NIPS 2012: 2663-2671 - [c11]Matthias Broecheler, Andrea Pugliese, V. S. Subrahmanian:
Efficient multi-view maintenance in the social semantic web. WWW (Companion Volume) 2012: 467-468 - [i1]Matthias Bröcheler, Lilyana Mihalkova, Lise Getoor:
Probabilistic Similarity Logic. CoRR abs/1203.3469 (2012) - 2011
- [b1]Matthias Broecheler:
Social Network Data Management. University of Maryland, College Park, MD, USA, 2011 - [c10]Matthias Bröcheler, Andrea Pugliese, V. S. Subrahmanian:
Probabilistic Subgraph Matching on Huge Social Networks. ASONAM 2011: 271-278 - [c9]Massimiliano Albanese, Matthias Broecheler, John Grant, Maria Vanina Martinez, V. S. Subrahmanian:
PLINI: A Probabilistic Logic Program Framework for Inconsistent News Information. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning 2011: 347-376 - [c8]Matthias Bröcheler, Andrea Pugliese, V. S. Subrahmanian:
A budget-based algorithm for efficient subgraph matching on Huge Networks. ICDE Workshops 2011: 94-99 - 2010
- [c7]Matthias Bröcheler, Andrea Pugliese, V. S. Subrahmanian:
COSI: Cloud Oriented Subgraph Identification in Massive Social Networks. ASONAM 2010: 248-255 - [c6]Matthias Broecheler, Lise Getoor:
Computing Marginal Distributions over Continuous Markov Networks for Statistical Relational Learning. NIPS 2010: 316-324 - [c5]Matthias Broecheler, Paulo Shakarian, V. S. Subrahmanian:
A Scalable Framework for Modeling Competitive Diffusion in Social Networks. SocialCom/PASSAT 2010: 295-302 - [c4]Matthias Bröcheler, Lilyana Mihalkova, Lise Getoor:
Probabilistic Similarity Logic. UAI 2010: 73-82
2000 – 2009
- 2009
- [c3]Matthias Broecheler, Gerardo I. Simari, V. S. Subrahmanian:
Using Histograms to Better Answer Queries to Probabilistic Logic Programs. ICLP 2009: 40-54 - [c2]Matthias Bröcheler, Andrea Pugliese, V. S. Subrahmanian:
DOGMA: A Disk-Oriented Graph Matching Algorithm for RDF Databases. ISWC 2009: 97-113 - 2008
- [c1]Gerardo I. Simari, Matthias Broecheler, V. S. Subrahmanian, Sarit Kraus:
Promises Kept, Promises Broken: An Axiomatic and Quantitative Treatment of Fulfillment. KR 2008: 59-69
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 2024-09-13 00:44 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:
