default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAzadeh Khaleghi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Azadeh Khaleghi:
Restless Linear Bandits. CoRR abs/2405.10817 (2024)- 2023
- [j5]Azadeh Khaleghi
, Gábor Lugosi:
Inferring the Mixing Properties of a Stationary Ergodic Process From a Single Sample-Path. IEEE Trans. Inf. Theory 69(6): 4014-4026 (2023) - 2021
- [j4]Steffen Grünewälder, Azadeh Khaleghi:
Oblivious Data for Fairness with Kernels. J. Mach. Learn. Res. 22: 208:1-208:36 (2021) - [i7]Azadeh Khaleghi, Lukas Zierahn:
PyChEst: a Python package for the consistent retrospective estimation of distributional changes in piece-wise stationary time series. CoRR abs/2112.10565 (2021) - 2020
- [c7]Azadeh Khaleghi, Daniil Ryabko:
Clustering piecewise stationary processes. ISIT 2020: 2753-2758 - [i6]Steffen Grünewälder, Azadeh Khaleghi:
Oblivious Data for Fairness with Kernels. CoRR abs/2002.02901 (2020)
2010 – 2019
- 2019
- [j3]Steffen Grünewälder, Azadeh Khaleghi:
Approximations of the Restless Bandit Problem. J. Mach. Learn. Res. 20: 14:1-14:37 (2019) - [i5]Azadeh Khaleghi, Daniil Ryabko:
Clustering piecewise stationary processes. CoRR abs/1906.10921 (2019) - 2017
- [e1]Oren Anava, Azadeh Khaleghi, Marco Cuturi, Vitaly Kuznetsov, Alexander Rakhlin:
Proceedings of the NIPS 2016 Time Series Workshop, co-located with the 30th Annual Conference on Neural Information Processing Systems (NIPS 2016), Barcelona, Spain, December 9, 2016. JMLR Workshop and Conference Proceedings 55, JMLR.org 2017 [contents] - [i4]Steffen Grünewälder, Azadeh Khaleghi:
Approximations of the Restless Bandit Problem. CoRR abs/1702.06972 (2017) - 2016
- [j2]Azadeh Khaleghi, Daniil Ryabko, Jérémie Mary, Philippe Preux:
Consistent Algorithms for Clustering Time Series. J. Mach. Learn. Res. 17: 3:1-3:32 (2016) - [j1]Azadeh Khaleghi, Daniil Ryabko:
Nonparametric multiple change point estimation in highly dependent time series. Theor. Comput. Sci. 620: 119-133 (2016) - 2014
- [c6]Azadeh Khaleghi, Daniil Ryabko:
Asymptotically consistent estimation of the number of change points in highly dependent time series. ICML 2014: 539-547 - 2013
- [b1]Azadeh Khaleghi:
On Some Unsupervised Learning Problems for Highly Dependent Time Series. (Sur quelques problèmes non-supervisés impliquant des séries temporelles hautement dèpendantes). INRIA, France, 2013 - [c5]Azadeh Khaleghi, Daniil Ryabko:
Nonparametric Multiple Change Point Estimation in Highly Dependent Time Series. ALT 2013: 382-396 - [i3]Azadeh Khaleghi, Daniil Ryabko:
A consistent clustering-based approach to estimating the number of change-points in highly dependent time-series. CoRR abs/1302.3407 (2013) - 2012
- [c4]Azadeh Khaleghi, Daniil Ryabko:
Locating Changes in Highly Dependent Data with Unknown Number of Change Points. NIPS 2012: 3095-3103 - [c3]Azadeh Khaleghi, Daniil Ryabko, Jérémie Mary, Philippe Preux:
Online Clustering of Processes. AISTATS 2012: 601-609 - [i2]Azadeh Khaleghi, Daniil Ryabko:
Multiple Change-Point Estimation in Stationary Ergodic Time-Series. CoRR abs/1203.1515 (2012)
2000 – 2009
- 2009
- [c2]Azadeh Khaleghi, Danilo Silva, Frank R. Kschischang:
Subspace Codes. IMACC 2009: 1-21 - [i1]Azadeh Khaleghi, Frank R. Kschischang:
Projective Space Codes for the Injection Metric. CoRR abs/0904.0813 (2009) - 2006
- [c1]Sam Mavandadi, Parham Aarabi, Azadeh Khaleghi, Ron D. Appel:
Predictive Dynamic User Interfaces for Interactive Visual Search. ICME 2006: 381-384
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 01:39 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:
