Search

Your search keyword '"Laboratoire de l'Informatique du Parallélisme ( LIP )"' showing total 4,362 results

Search Constraints

Start Over You searched for: Author "Laboratoire de l'Informatique du Parallélisme ( LIP )" Remove constraint Author: "Laboratoire de l'Informatique du Parallélisme ( LIP )"
4,362 results on '"Laboratoire de l'Informatique du Parallélisme ( LIP )"'

Search Results

1. Latency-Aware Strategies for Deploying Data Stream Processing Applications on Large Cloud-Edge Infrastructure

2. Implicit Differentiation for Hyperparameter Tuning the Weighted Graphical Lasso

Catalog

Books, media, physical & digital resources

3. Does a sparse ReLU network training problem always admit an optimum?

4. Trading performance for memory in sparse direct solvers using low-rank compression

5. Controlling Wasserstein Distances by Kernel Norms with Application to Compressive Statistical Learning

6. Accurate calculation of Euclidean Norms using Double-word arithmetic

7. Des règles de quadrature dans les RKHSs à base de DPPs

8. A Polyhedral Approach for Scalar Promotion

9. Fast Learning of Fast Transforms, with Guarantees

10. Fast Multiscale Diffusion On Graphs

11. Dynamic DAG Scheduling Under Memory Constraints for Shared-Memory Platforms

12. Resilient Scheduling Heuristics for Rigid Parallel Jobs

13. Fast computation of approximant bases in canonical form

14. Energy-aware mapping and scheduling strategies for real-time workflows under reliability constraints

15. Checkpointing strategies to protect parallel jobs from non-memoryless fail-stop errors

16. Optimal Checkpointing Strategies for Iterative Applications

17. Efficient and Validated Numerical Evaluation of Abelian Integrals

18. Scaling matrices and counting the perfect matchings in graphs

19. Toward an intelligent and efficient beehive: A survey of precision beekeeping systems and services

20. Efficient Identification of Butterfly Sparse Matrix Factorizations

21. Affine Iterations and Wrapping Effect: Various Approaches

22. Affine Multibanking for High-Level Synthesis

23. Shared-memory implementation of the Karp-Sipser kernelization process

24. Solution de gestion pilotée par les données pour les applications Deep Learning basées sur des microservices

25. Towards Trace-Based Array Contraction

26. Distances de Diffusion-Wasserstein pour les graphes attribués

27. Subspace Detours Meet Gromov-Wasserstein

28. An analysis of Ermakov-Zolotukhin quadrature using kernels

29. An Anonymous Trace-and-Revoke Broadcast Encryption Scheme

30. Improving the Spatial Reuse in IEEE 802.11ax WLANs: A Multi-Armed Bandit Approach

31. Exploiting Frame Aggregation to Enhance Access Point Selection

32. Towards a Throughput and Energy Efficient Association Strategy for Wi-Fi/LiFi Heterogeneous Networks

33. Aspects cryptographiques des réseaux orthogonaux

34. S4BXI: the MPI-ready Portals 4 Simulator

35. Shelf schedules for independent moldable tasks to minimize the energy consumption

36. Enabling microservices management for Deep Learning applications across the Edge-Cloud Continuum

37. A Polyhedral Approach for Auto-Parallelization using a Distributed Virtual Machine

38. Compiling pattern matching to in-place modifications

39. Bifurcated Signatures: Folding the Accountability vs. Anonymity Dilemma into a Single Private Signing Scheme

40. Faster Modular Composition

41. Semi-relaxed Gromov Wasserstein divergence with applications on graphs

42. Non-applicability of the Gaborit&Aguilar-Melchor patent to Kyber and Saber

43. Budget-aware Static Scheduling of Stochastic Workflows with DIET

44. Scheduling independent tasks under budget and time constraints

45. Extension of Flocking Models to Environments with Obstacles and Degraded Communications

46. Locality-Aware Scheduling of Independent Tasks for Runtime Systems

47. Isomorphisms are back!: Smart indexing for function retrieval by unification modulo type isomorphisms

48. Resilient Scheduling of Moldable Parallel Jobs to Cope with Silent Errors

49. Absolute Root Separation

50. Coppersmith's block Wiedemann method for polynomial problems