Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this paper, the authors consider a general supervised learning problem with strongly convex and Lipshitz loss and study the problem of model selection aggre- gation, given a finite dictionary function (learners) together with the prior.
Abstract: We consider a general supervised learning problem with strongly convex and Lipshitz loss and study the problem of model selection aggre- gation. In particular, given a finite dictionary functions (learners) together with the prior, we generalize the results obtained by Dai, Rigollet and Zhang (2012) for Gaussian regression with squared loss and fixed design to this learning setup. Specifically, we prove that the Q-aggregation pro- cedure outputs an estimator that satisfies optimal oracle inequalities both in expectation and with high probability. Our proof techniques somewhat depart from traditional proofs by making most of the standard arguments on the Laplace transform of the empirical process to be controlled. AMS 2000 subject classifications: Primary 62H25; secondary 62F04, 90C22.
30 citations
••
TL;DR: In this paper, the problem of steady, two-dimensional laminar natural convection in a system of parallel vertical channels with a single protruding heat module mounted mid-height on a substrate of finite-thickness was numerically investigated.
30 citations
••
TL;DR: The method provides an index on sequences that is applied to compare them without any alignment to extract regions having similar combinatorial features that would not have been found by standard alignment methods.
30 citations
••
TL;DR: It is proved that rational sets of words on countable scattered linear orderings are closed under complementation using an algebraic approach.
Abstract: In a preceding paper (Bruyere and Carton, automata on linear orderings, MFCS'01), automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite and even transfinite words studied by Buchi. Kleene's theorem has been generalized to these words. We prove that rational sets of words on countable scattered linear orderings are closed under complementation using an algebraic approach.
30 citations
••
09 Jun 2013TL;DR: This paper proposes a hybrid approach, denoted mobility-Prediction-based Hybrid Routing and Hierarchical Location Service (PHRHLS), coupling a VANET routing protocol, the Greedy Perimeter Stateless Routing (GPSR), and the HLS extended with a mobility prediction algorithm, and shows that it reduces the localization overhead and enhances the routing performances.
Abstract: Location-based services provide (and maintain) location information used by geographic routing protocols. Routing and location service are widely related, but handled separately in usual studies about Vehicular Ad hoc Network (VANET). In this paper, we propose a hybrid approach, denoted mobility-Prediction-based Hybrid Routing and Hierarchical Location Service (PHRHLS), coupling a VANET routing protocol, the Greedy Perimeter Stateless Routing (GPSR), and the Hierarchical Location Service (HLS) extended with a mobility prediction algorithm. We show that our approach, PHRHLS, reduces the localization overhead and enhances the routing performances. Indeed, our extensive simulations show promising results in terms of end-to-end latency, packet delivery ratio and control message overhead.
30 citations
Authors
Showing all 831 results
Name | H-index | Papers | Citations |
---|---|---|---|
Dapeng Yu | 94 | 745 | 33613 |
Daniel Azoulay | 78 | 510 | 23979 |
Mehmet A. Oturan | 77 | 261 | 22682 |
Alfred O. Hero | 73 | 899 | 29258 |
Nihal Oturan | 64 | 174 | 12092 |
Jean-Christophe Pesquet | 50 | 364 | 13264 |
Eric D. van Hullebusch | 50 | 265 | 9030 |
Christian Soize | 48 | 529 | 9932 |
Maxime Crochemore | 47 | 314 | 9836 |
Jean-Yves Thibon | 42 | 191 | 6398 |
Marie-France Sagot | 41 | 191 | 5972 |
François Farges | 41 | 111 | 6349 |
Laurent Najman | 40 | 233 | 9238 |
Renaud Keriven | 39 | 108 | 6330 |
Robert Eymard | 39 | 171 | 6964 |