default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Grossglauser
Person information
- affiliation: Swiss Federal Institute of Technology in Lausanne, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c59]Maximilien Dreveton, Alperen Gözeten, Matthias Grossglauser, Patrick Thiran:
Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Models. COLT 2024: 1451-1485- [c58]Aswin Suresh, Chi-Hsuan Wu, Matthias Grossglauser:
It's All Relative: Learning Interpretable Models for Scoring Subjective Bias in Documents from Pairwise Comparisons. EACL (1) 2024: 1341-1353 - [c57]Aswin Suresh, Lazar Radojevic, Francesco Salvi, Antoine Magron, Victor Kristof, Matthias Grossglauser:
Discovering Lobby-Parliamentarian Alignments through NLP. NAACL-HLT 2024: 8107-8120 - [i25]Maximilien Dreveton, Alperen Gözeten, Matthias Grossglauser, Patrick Thiran:
Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Models. CoRR abs/2402.15432 (2024) - [i24]Amir Mohammad Abouei, Ehsan Mokhtarian, Negar Kiyavash, Matthias Grossglauser:
Causal Effect Identification in a Sub-Population with Latent Variables. CoRR abs/2405.14547 (2024) - [i23]Maximilien Dreveton, Charbel Chucri, Matthias Grossglauser, Patrick Thiran:
Why the Metric Backbone Preserves Community Structure. CoRR abs/2406.03852 (2024) - 2023
- [i22]Maximilien Dreveton, Daichi Kuroda, Matthias Grossglauser, Patrick Thiran:
When Does Bottom-up Beat Top-down in Hierarchical Community Detection? CoRR abs/2306.00833 (2023) - [i21]Daniyar Chumbalov, Lars Klein, Lucas Maystre, Matthias Grossglauser:
Fast Interactive Search with a Scale-Free Comparison Oracle. CoRR abs/2306.01814 (2023) - [i20]Aswin Suresh, Chi-Hsuan Wu, Matthias Grossglauser:
It's All Relative: Interpretable Models for Scoring Bias in Documents. CoRR abs/2307.08139 (2023) - [i19]Aswin Suresh, Lazar Radojevic, Francesco Salvi
, Antoine Magron, Victor Kristof, Matthias Grossglauser:
Studying Lobby Influence in the European Parliament. CoRR abs/2309.11381 (2023) - [i18]Sadegh Khorasani, Saber Salehkaleybar, Negar Kiyavash, Niao He, Matthias Grossglauser:
Efficiently Escaping Saddle Points for Non-Convex Policy Optimization. CoRR abs/2311.08914 (2023) - 2021
- [c56]Jalal Etesami, William Trouleau, Negar Kiyavash, Matthias Grossglauser, Patrick Thiran:
A Variational Inference Approach to Learning Multivariate Wold Processes. AISTATS 2021: 2044-2052 - [c55]William Trouleau, Jalal Etesami, Matthias Grossglauser, Negar Kiyavash, Patrick Thiran:
Cumulants of Hawkes Processes are Robust to Observation Noise. ICML 2021: 10444-10454 - [c54]Victor Kristof, Aswin Suresh, Matthias Grossglauser, Patrick Thiran:
War of Words II: Enriched Models of Law-Making Processes. WWW 2021: 2014-2024 - 2020
- [j21]Ehsan Kazemi, Matthias Grossglauser:
MPGM: Scalable and Accurate Multiple Network Alignment. IEEE ACM Trans. Comput. Biol. Bioinform. 17(6): 2040-2052 (2020) - [c53]Daniyar Chumbalov, Lucas Maystre, Matthias Grossglauser:
Scalable and Efficient Comparison-based Search without Features. ICML 2020: 1995-2005 - [c52]Alexander Immer, Victor Kristof, Matthias Grossglauser, Patrick Thiran:
Sub-Matrix Factorization for Real-Time Vote Prediction. KDD 2020: 2280-2290 - [c51]Victor Kristof, Matthias Grossglauser, Patrick Thiran:
War of Words: The Competitive Dynamics of Legislative Processes. WWW 2020: 2803-2809 - [i17]Carlos Medina, Arnout Devos, Matthias Grossglauser:
Self-Supervised Prototypical Transfer Learning for Few-Shot Classification. CoRR abs/2006.11325 (2020)
2010 – 2019
- 2019
- [j20]Osman Emre Dai, Daniel Cullina, Negar Kiyavash, Matthias Grossglauser:
Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdos-Rényi Graphs. Proc. ACM Meas. Anal. Comput. Syst. 3(2): 36:1-36:25 (2019) - [c50]Arnout Devos, Sylvain Chatel, Matthias Grossglauser:
Reproducing Meta-learning with differentiable closed-form solvers. RML@ICLR 2019 - [c49]William Trouleau, Jalal Etesami, Matthias Grossglauser, Negar Kiyavash, Patrick Thiran:
Learning Hawkes Processes Under Synchronization Noise. ICML 2019: 6325-6334 - [c48]Lucas Maystre, Victor Kristof, Matthias Grossglauser:
Pairwise Comparisons with Flexible Time-Dynamics. KDD 2019: 1236-1246 - [c47]Farnood Salehi, William Trouleau, Matthias Grossglauser, Patrick Thiran:
Learning Hawkes Processes from a handful of events. NeurIPS 2019: 12694-12704 - [c46]Osman Emre Dai, Daniel Cullina, Negar Kiyavash, Matthias Grossglauser:
Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdős-Rényi Graphs. SIGMETRICS (Abstracts) 2019: 97-98 - [i16]Lucas Maystre, Victor Kristof, Matthias Grossglauser:
Linear-Time Inference for Pairwise Comparisons with Gaussian-Process Dynamics. CoRR abs/1903.07746 (2019) - [i15]Daniyar Chumbalov, Lucas Maystre, Matthias Grossglauser:
Learning to Search Efficiently Using Comparisons. CoRR abs/1905.05049 (2019) - [i14]Arnout Devos, Matthias Grossglauser:
Subspace Networks for Few-shot Classification. CoRR abs/1905.13613 (2019) - [i13]Farnood Salehi, William Trouleau, Matthias Grossglauser, Patrick Thiran:
Learning Hawkes Processes from a Handful of Events. CoRR abs/1911.00292 (2019) - [i12]Victor Kristof, Valentin Quelquejay-Leclère, Robin Zbinden, Lucas Maystre, Matthias Grossglauser, Patrick Thiran:
A User Study of Perceived Carbon Footprint. CoRR abs/1911.11658 (2019) - 2018
- [c45]Ali Batuhan Yardim, Victor Kristof, Lucas Maystre, Matthias Grossglauser:
Can Who-Edits-What Predict Edit Survival? KDD 2018: 2604-2613 - [i11]Ali Batuhan Yardim, Victor Kristof, Lucas Maystre, Matthias Grossglauser:
Can Who-Edits-What Predict Edit Survival? CoRR abs/1801.04159 (2018) - [i10]Osman Emre Dai, Daniel Cullina, Negar Kiyavash, Matthias Grossglauser:
On the Performance of a Canonical Labeling for Matching Correlated Erdős-Rényi Graphs. CoRR abs/1804.09758 (2018) - [i9]Ehsan Kazemi, Matthias Grossglauser:
MPGM: Scalable and Accurate Multiple Network Alignment. CoRR abs/1804.10029 (2018) - 2017
- [c44]Lucas Maystre, Matthias Grossglauser:
Just Sort It! A Simple and Effective Approach to Active Preference Learning. ICML 2017: 2344-2353 - [c43]Lucas Maystre, Matthias Grossglauser:
ChoiceRank: Identifying Preferences from Node Traffic in Networks. ICML 2017: 2354-2362 - 2016
- [j19]Ehsan Kazemi, Seyed Hamed Hassani, Matthias Grossglauser, Hassan Pezeshgi Modarres:
PROPER: global protein interaction network alignment through percolation matching. BMC Bioinform. 17: 527:1-527:16 (2016) - [c42]Young-Jun Ko, Lucas Maystre, Matthias Grossglauser:
Collaborative Recurrent Neural Networks for Dynamic Recommender Systems. ACML 2016: 366-381 - [c41]Lyudmila Yartseva, Jefferson Elbert Simães, Matthias Grossglauser:
Assembling a network out of ambiguous patches. Allerton 2016: 883-890 - [c40]Vincent Etter, Mohammad Emtiyaz Khan, Matthias Grossglauser, Patrick Thiran:
Online Collaborative Prediction of Regional Vote Results. DSAA 2016: 233-242 - [c39]Lucas Maystre, Victor Kristof, Antonio J. González Ferrer, Matthias Grossglauser:
The Player Kernel: Learning Team Strengths Based on Implicit Player Contributions. MLSA@PKDD/ECML 2016 - [c38]Mohamed Kafsi, Raphaël Braunschweig, Danielle Mersch, Matthias Grossglauser, Laurent Keller, Patrick Thiran:
Uncovering Latent Behaviors in Ant Colonies. SDM 2016: 450-458 - [i8]Ehsan Kazemi, Matthias Grossglauser:
On the Structure and Efficient Computation of IsoRank Node Similarities. CoRR abs/1602.00668 (2016) - [i7]Lucas Maystre, Victor Kristof, Antonio J. González Ferrer, Matthias Grossglauser:
The Player Kernel: Learning Team Strengths Based on Implicit Player Contributions. CoRR abs/1609.01176 (2016) - [i6]Lucas Maystre, Matthias Grossglauser:
ChoiceRank: Identifying Preferences from Node Traffic in Networks. CoRR abs/1610.06525 (2016) - 2015
- [j18]Ehsan Kazemi, Seyed Hamed Hassani, Matthias Grossglauser:
Growing a Graph Matching from a Handful of Seeds. Proc. VLDB Endow. 8(10): 1010-1021 (2015) - [j17]Dominique Tschopp, Suhas N. Diggavi, Matthias Grossglauser:
Hierarchical routing over dynamic wireless networks. Random Struct. Algorithms 47(4): 669-709 (2015) - [c37]Ehsan Kazemi, Lyudmila Yartseva, Matthias Grossglauser:
When can two unlabeled networks be aligned under partial overlap? Allerton 2015: 33-42 - [c36]Mohamed Kafsi, Matthias Grossglauser, Patrick Thiran:
Traveling Salesman in Reverse: Conditional Markov Entropy for Trajectory Segmentation. ICDM 2015: 201-210 - [c35]Lucas Maystre, Matthias Grossglauser:
Fast and Accurate Inference of Plackett-Luce Models. NIPS 2015: 172-180 - [e1]Aneesh Sharma, Rakesh Agrawal, Matthias Grossglauser:
Proceedings of the 2015 ACM on Conference on Online Social Networks, COSN 2015, Palo Alto, California, USA, November 2-3, 2015. ACM 2015, ISBN 978-1-4503-3951-3 [contents] - [i5]Lucas Maystre, Matthias Grossglauser:
Robust Active Ranking from Sparse Noisy Comparisons. CoRR abs/1502.05556 (2015) - 2014
- [c34]Vincent Etter, Julien Herzen, Matthias Grossglauser, Patrick Thiran:
Mining democracy. COSN 2014: 1-12 - 2013
- [j16]Vincent Etter, Mohamed Kafsi, Ehsan Kazemi, Matthias Grossglauser, Patrick Thiran:
Where to go from here? Mobility prediction from instantaneous information. Pervasive Mob. Comput. 9(6): 784-797 (2013) - [j15]Mohamed Kafsi, Matthias Grossglauser, Patrick Thiran:
The Entropy of Conditional Markov Trajectories. IEEE Trans. Inf. Theory 59(9): 5577-5583 (2013) - [c33]Pedram Pedarsani, Daniel R. Figueiredo, Matthias Grossglauser:
A Bayesian method for matching two similar graphs without seeds. Allerton 2013: 1598-1607 - [c32]Lyudmila Yartseva, Matthias Grossglauser:
On the performance of percolation graph matching. COSN 2013: 119-130 - [c31]Vincent Etter, Matthias Grossglauser, Patrick Thiran:
Launch hard or go home!: predicting the success of kickstarter campaigns. COSN 2013: 177-182 - [c30]Mathias Humbert, Théophile Studer, Matthias Grossglauser, Jean-Pierre Hubaux:
Nowhere to Hide: Navigating around Privacy in Online Social Networks. ESORICS 2013: 682-699 - [i4]Mohamed Kafsi, Ehsan Kazemi, Lucas Maystre, Lyudmila Yartseva, Matthias Grossglauser, Patrick Thiran:
Mitigating Epidemics through Mobile Micro-measures. CoRR abs/1307.2084 (2013) - 2012
- [c29]Matthias Grossglauser:
Random graph models for wireless and social networks: keynote talk abstract. MobiOpp 2012: 1-2 - [i3]Mohamed Kafsi, Matthias Grossglauser, Patrick Thiran:
Entropy of Conditional Markov Trajectories. CoRR abs/1212.2831 (2012) - 2011
- [j14]Henri Dubois-Ferrière, Matthias Grossglauser, Martin Vetterli:
Valuable detours: least-cost anypath routing. IEEE/ACM Trans. Netw. 19(2): 333-346 (2011) - [c28]Pedram Pedarsani, Matthias Grossglauser:
On the privacy of anonymized networks. KDD 2011: 1235-1243
2000 – 2009
- 2009
- [i2]Dominique Tschopp, Suhas N. Diggavi, Matthias Grossglauser:
Hierarchical Routing over Dynamic Wireless Networks. CoRR abs/0909.2504 (2009) - [i1]Nick G. Duffield, Derek Chiou, Benoit Claise, Albert G. Greenberg, Matthias Grossglauser, Jennifer Rexford:
A Framework for Packet Selection and Reporting. RFC 5474: 1-38 (2009) - 2008
- [j13]Michal Piórkowski, Maxim Raya, A. Lezama Lugo, Panagiotis Papadimitratos, Matthias Grossglauser, Jean-Pierre Hubaux:
TraNS: realistic joint traffic and network simulator for VANETs. ACM SIGMOBILE Mob. Comput. Commun. Rev. 12(1): 31-33 (2008) - [j12]Nick G. Duffield, Matthias Grossglauser:
Trajectory sampling with unreliable reporting. IEEE/ACM Trans. Netw. 16(1): 37-50 (2008) - [c27]Hung Xuan Nguyen, Daniel R. Figueiredo, Matthias Grossglauser, Patrick Thiran:
Balanced Relay Allocation on Heterogeneous Unstructured Overlays. INFOCOM 2008: 126-130 - [c26]Michal Piórkowski, Natasa Sarafijanovic-Djukic, Matthias Grossglauser:
On clustering phenomenon in mobile partitioned networks. MobilityModels 2008: 1-8 - [c25]Dominique Tschopp, Suhas N. Diggavi, Matthias Grossglauser:
Hierarchical routing over dynamic wireless networks. SIGMETRICS 2008: 73-84 - [c24]Pedram Pedarsani, Daniel R. Figueiredo, Matthias Grossglauser:
Densification arising from sampling fixed graphs. SIGMETRICS 2008: 205-216 - 2007
- [c23]Dominique Tschopp, Suhas N. Diggavi, Matthias Grossglauser, Jörg Widmer:
Robust Geo-Routing on Embeddings of Dynamic Wireless Networks. INFOCOM 2007: 1730-1738 - 2006
- [j11]Matthias Grossglauser:
10 papers on network models. Comput. Commun. Rev. 36(5): 63-65 (2006) - [j10]Suhas N. Diggavi, Matthias Grossglauser:
On information transmission over a finite buffer channel. IEEE Trans. Inf. Theory 52(3): 1226-1237 (2006) - [j9]Matthias Grossglauser, Martin Vetterli:
Locating mobile nodes with EASE: learning efficient routes from encounter histories alone. IEEE/ACM Trans. Netw. 14(3): 457-469 (2006) - [c22]Jun Luo, Jacques Panchard, Michal Piórkowski, Matthias Grossglauser, Jean-Pierre Hubaux:
MobiRoute: Routing Towards a Mobile Sink for Improving Lifetime in Sensor Networks. DCOSS 2006: 480-497 - [c21]Michal Piórkowski, Matthias Grossglauser:
Constrained Tracking on a Road Network. EWSN 2006: 148-163 - [c20]Natasa Sarafijanovic-Djukic, Michal Piórkowski, Matthias Grossglauser:
Island Hopping: Efficient Mobility-Assisted Forwarding in Partitioned Networks. SECON 2006: 226-235 - 2005
- [j8]Suhas N. Diggavi, Matthias Grossglauser, David N. C. Tse:
Even One-Dimensional Mobility Increases the Capacity of Wireless Networks. IEEE Trans. Inf. Theory 51(11): 3947-3954 (2005) - [p1]Matthias Grossglauser, Jennifer Rexford:
Passive Traffic Measurement for Internet Protocol Operations. The Internet as a Large-Scale Complex System 2005: 91-120 - 2004
- [c19]Nick G. Duffield, Matthias Grossglauser:
Trajectory Sampling with Unreliable Reporting. INFOCOM 2004: 1570-1581 - [c18]Natasa Sarafijanovic-Djukic, Matthias Grossglauser:
Last Encounter Routing under Random Waypoint Mobility. NETWORKING 2004: 974-988 - 2003
- [j7]Matthias Grossglauser, David N. C. Tse:
A time-scale decomposition approach to measurement-based admission control. IEEE/ACM Trans. Netw. 11(4): 550-563 (2003) - [c17]Henri Dubois-Ferrière, Matthias Grossglauser, Martin Vetterli:
Space-Time Routing in Ad Hoc Networks. ADHOC-NOW 2003: 1-11 - [c16]Matthias Grossglauser, Martin Vetterli:
Locating Nodes with EASE: Mobility Diffusion of Last Encounters in Ad Hoc Networks. INFOCOM 2003: 1954-1964 - [c15]Henri Dubois-Ferrière, Matthias Grossglauser, Martin Vetterli:
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages. MobiHoc 2003: 257-266 - 2002
- [j6]Matthias Grossglauser, David N. C. Tse:
Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. Netw. 10(4): 477-486 (2002) - [c14]Nick G. Duffield, Alexandre Gerber, Matthias Grossglauser:
Trajectory engine: a backend for trajectory sampling. NOMS 2002: 437-450 - 2001
- [j5]Nick G. Duffield, Matthias Grossglauser:
Trajectory sampling for direct traffic observation. IEEE/ACM Trans. Netw. 9(3): 280-292 (2001) - [c13]Matthias Grossglauser, David N. C. Tse:
Mobility Increases the Capacity of Ad-hoc Wireless Networks. INFOCOM 2001: 1360-1369 - [c12]Matthias Grossglauser, Balachander Krishnamurthy:
Looking for Science in the Art of Network Measurement. IWDC 2001: 524-535 - 2000
- [c11]Matthias Grossglauser, Jean-Chrysostome Bolot:
On Service Models for Multicast Transmission in Heterogeneous Environments. INFOCOM 2000: 71-80 - [c10]Nick G. Duffield, Matthias Grossglauser:
Trajectory sampling for direct traffic observation. SIGCOMM 2000: 271-282
1990 – 1999
- 1999
- [j4]Matthias Grossglauser, David N. C. Tse:
A framework for robust measurement-based admission control. IEEE/ACM Trans. Netw. 7(3): 293-309 (1999) - [j3]Matthias Grossglauser, Jean-Chrysostome Bolot:
On the relevance of long-range dependence in network traffic. IEEE/ACM Trans. Netw. 7(5): 629-640 (1999) - [c9]Matthias Grossglauser, David N. C. Tse:
A Time-Scale Decomposition Approach to Measurement-Based Admission Control. INFOCOM 1999: 1539-1547 - 1997
- [j2]Matthias Grossglauser:
Optimal Deterministic Timeouts for Reliable Scalable Multicast. IEEE J. Sel. Areas Commun. 15(3): 422-433 (1997) - [j1]Matthias Grossglauser, Srinivasan Keshav, David N. C. Tse:
RCBR: a simple and efficient service for multiple time-scale traffic. IEEE/ACM Trans. Netw. 5(6): 741-755 (1997) - [c8]Matthias Grossglauser, K. K. Ramakrishnan:
SEAM: Scalable and Efficient ATM Multicast. INFOCOM 1997: 867-875 - [c7]David N. C. Tse, Matthias Grossglauser:
Measurement-Based Call Admission Control: Analysis and Simulation. INFOCOM 1997: 981-989 - [c6]Matthias Grossglauser, David N. C. Tse:
A Framework for Robust Measurement-Based Admission Control. SIGCOMM 1997: 237-248 - 1996
- [c5]Matthias Grossglauser, Srinivasan Keshav:
On CBR Service. INFOCOM 1996: 129-137 - [c4]Matthias Grossglauser:
Optimal Deterministic Timeouts for Reliable Scalable Multicast. INFOCOM 1996: 1425-1432 - [c3]Matthias Grossglauser, Jean-Chrysostome Bolot:
On the Relevance of Long-Range Dependence in Network Traffic. SIGCOMM 1996: 15-24 - 1995
- [c2]Matthias Grossglauser, Srinivasan Keshav, David N. C. Tse:
RCBR: A Simple and Efficient Service for Multiple Time-Scale Traffic. SIGCOMM 1995: 219-230 - 1993
- [c1]D. Scott Wills, Matthias Grossglauser:
A Scalable Optical Interconnection Network for Fine-Grain Parallel Architectures. ICPP (1) 1993: 154-157
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-10-07 21:25 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:
