default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Michel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j4]Thomas Michel, Hossein Hajiabolhassan, Ronald Ortner:
Regret Bounds for Satisficing in Multi-Armed Bandit Problems. Trans. Mach. Learn. Res. 2023 (2023)
2010 – 2019
- 2019
- [i4]Fei Wu, Thomas Michel, Alexandre Briot:
Leveraging Model Interpretability and Stability to increase Model Robustness. CoRR abs/1910.00387 (2019) - 2016
- [b1]Thomas Michel:
Analyse mathématique et calibration de modèles de croissance tumorale. (Mathematical analysis and model calibration for tumor growth models). University of Bordeaux, France, 2016 - 2015
- [c11]Gordon Hunter, James Denholm-Price, Thomas Michel, John Yardley, David Fox:
Progress Towards a Smarter Office via a Novel Intelligent System for Message Organisation by Unifying E-Mails & Phone Calls. Intelligent Environments (Workshops) 2015: 15-26 - [c10]Gordon Hunter, James Denholm-Price, Thomas Michel, John Yardley, David Fox:
Keeping Your Threads Untangled: An Intelligent System for Semi-automatically Organising Corporate Messages by Content. Intelligent Environments 2015: 164-167 - 2011
- [j3]Ingmar Blau, Gerhard Wunder, Thomas Michel:
Utility Optimization Based on MSE for Parallel Broadcast Channels: The Square Root Law. Wirel. Pers. Commun. 58(2): 239-257 (2011)
2000 – 2009
- 2009
- [j2]Gerhard Wunder, Thomas Michel, Chan Zhou:
Delay-limited transmission in OFDM systems: performance bounds and impact of system parameters. IEEE Trans. Wirel. Commun. 8(7): 3747-3757 (2009) - 2008
- [c9]Gerhard Wunder, Thomas Michel:
Multiuser OFDMA optimization: Algorithms and duality gap analysis. WSA 2008: 233-240 - 2007
- [j1]Gerhard Wunder, Thomas Michel:
Optimal Resource Allocation for Parallel Gaussian Broadcast Channels: Minimum Rate Constraints and Sum Power Minimization. IEEE Trans. Inf. Theory 53(12): 4817-4822 (2007) - [c8]Martina Ziefle, Ulrik Schroeder
, Judith Strenk, Thomas Michel:
How younger and older adults master the usage of hyperlinks in small screen devices. CHI 2007: 307-316 - [c7]Chan Zhou, Gerhard Wunder, Thomas Michel:
Utility Maximization for OFDMA Systems Over Discrete Sets. ICC 2007: 5726-5731 - [c6]Thomas Michel, Gerhard Wunder:
Nonlinear Downlink Beamforming Under QOS Constraints: Optimum Precoding Order and the Need for Time-Sharing. PIMRC 2007: 1-5 - [i3]Thomas Michel, Gerhard Wunder:
Transmitter and Precoding Order Optimization for Nonlinear Downlink Beamforming. CoRR abs/cs/0702122 (2007) - 2006
- [c5]Gerhard Wunder, Thomas Michel, Chan Zhou:
A framework for resource allocation in OFDM broadcast systems. EUSIPCO 2006: 1-5 - [c4]Thomas Michel, Gerhard Wunder:
Minimum Rates Scheduling for Ofdm Broadcast Channels. ICASSP (4) 2006: 41-44 - [c3]Gerhard Wunder, Thomas Michel:
Delay-limited OFDM broadcast capacity region and impact of system parameters. ITW 2006: 14-18 - [i2]Gerhard Wunder, Thomas Michel:
Optimal resource allocation for OFDM multiuser channels. CoRR abs/cs/0608023 (2006) - [i1]Gerhard Wunder, Thomas Michel:
The Delay-Limited Capacity Region of OFDM Broadcast Channels. CoRR abs/cs/0610061 (2006) - 2005
- [c2]Thomas Michel, Gerhard Wunder:
Optimal and low complex suboptimal transmission schemes for MIMO-OFDM broadcast channels. ICC 2005: 438-442 - [c1]Thomas Haustein, Stefan Schiffermüller, Volker Jungnickel, Malte Schellmann, Thomas Michel, Gerhard Wunder:
Interpolation and noise reduction in MIMO-OFDM - a complexity driven perspective. ISSPA 2005: 143-146
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-08-02 20:20 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:
