default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Guex
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Pierre Leleux, Bertrand Lebichot
, Guillaume Guex, Marco Saerens:
Sparse randomized policies for Markov decision processes based on Tsallis divergence regularization. Knowl. Based Syst. 300: 112105 (2024)- 2023
- [j6]Guillaume Guex, Romain Loup, François Bavaud:
Estimation of flow trajectories in a multi-lines transportation network. Appl. Netw. Sci. 8(1): 44 (2023) - [j5]Sylvain Courtain, Guillaume Guex, Ilkka Kivimäki, Marco Saerens:
Relative entropy-regularized optimal transport on a graph: a new algorithm and an experimental comparison. Int. J. Mach. Learn. Cybern. 14(4): 1365-1390 (2023) - 2022
- [c4]Guillaume Guex:
A Framework for Embedding Entities in a Textual Narrative: a Case Study on Les Misérables. COMHUM 2022: 43-61 - 2021
- [j4]Guillaume Guex, Sylvain Courtain, Marco Saerens:
Covariance and correlation measures on a graph in a generalized bag-of-paths formalism. J. Complex Networks 8(6) (2021) - [j3]Pierre Leleux, Sylvain Courtain, Guillaume Guex, Marco Saerens:
Sparse randomized shortest paths routing with Tsallis divergence regularization. Data Min. Knowl. Discov. 35(3): 986-1031 (2021) - [j2]Sylvain Courtain, Pierre Leleux, Ilkka Kivimäki, Guillaume Guex, Marco Saerens:
Randomized shortest paths with net flows and capacity constraints. Inf. Sci. 556: 341-360 (2021) - [i7]Sylvain Courtain, Guillaume Guex, Ilkka Kivimäki, Marco Saerens:
Relative Entropy-Regularized Optimal Transport on a Graph: a new algorithm and an experimental comparison. CoRR abs/2108.10004 (2021) - 2020
- [i6]Pierre Leleux, Sylvain Courtain, Guillaume Guex, Marco Saerens:
Sparse Randomized Shortest Paths Routing with Tsallis Divergence Regularization. CoRR abs/2007.00419 (2020)
2010 – 2019
- 2019
- [j1]Guillaume Guex, Ilkka Kivimäki, Marco Saerens:
Randomized optimal transport on a graph: framework and new distance measures. Netw. Sci. 7(1): 88-122 (2019) - [i5]Guillaume Guex, Sylvain Courtain, Marco Saerens:
Covariance and Correlation Kernels on a Graph in the Generalized Bag-of-Paths Formalism. CoRR abs/1902.03002 (2019) - [i4]Sylvain Courtain, Pierre Leleux, Ilkka Kivimäki, Guillaume Guex, Marco Saerens:
Randomized Shortest Paths with Net Flows and Capacity Constraints. CoRR abs/1910.01849 (2019) - 2018
- [i3]Guillaume Guex, Ilkka Kivimäki, Marco Saerens:
Randomized Optimal Transport on a Graph: Framework and New Distance Measures. CoRR abs/1806.03232 (2018) - [i2]Bertrand Lebichot, Guillaume Guex, Ilkka Kivimäki, Marco Saerens:
A Constrained Randomized Shortest-Paths Framework for Optimal Exploration. CoRR abs/1807.04551 (2018) - 2015
- [p1]Aris Xanthos, Guillaume Guex:
On the Robust Measurement of Inflectional Diversity. Recent Contributions to Quantitative Linguistics 2015: 241-254 - 2014
- [c3]Guillaume Guex:
Spatial Graphs Cost and Efficiency: Exploring Edges Competition by MCMC. GIScience 2014: 97-108 - 2013
- [c2]Guillaume Guex, François Bavaud:
Flow-Based Dissimilarities: Shortest Path, Commute Time, Max-Flow and Free Energy. ECDA 2013: 101-111 - 2012
- [c1]François Bavaud, Guillaume Guex:
Interpolating between Random Walks and Shortest Paths: A Path Functional Approach. SocInfo 2012: 68-81 - [i1]François Bavaud, Guillaume Guex:
Interpolating between Random Walks and Shortest Paths: a Path Functional Approach. CoRR abs/1207.1253 (2012)
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-07-20 21:21 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:
