317 results on '"Philippas Tsigas"'
Search Results
2. $\mathtt {IP.LSH.DBSCAN}$: Integrated Parallel Density-Based Clustering Through Locality-Sensitive Hashing.
3. The Impact of Synchronization in Parallel Stochastic Gradient Descent.
4. Performance Analysis and Modelling of Concurrent Multi-access Data Structures.
5. ASAP.SGD: Instance-based Adaptiveness to Staleness in Asynchronous SGD.
6. pi-Lisco: parallel and incremental stream-based point-cloud clustering.
7. Consistent Lock-free Parallel Stochastic Gradient Descent for Fast and Stable Convergence.
8. TSLQueue: An Efficient Lock-Free Design for Priority Queues.
9. PARMA-CC: Parallel Multiphase Approximate Cluster Combining.
10. Monotonically Relaxing Concurrent Data-Structure Semantics for Increasing Performance: An Efficient 2D Design Framework.
11. STRETCH: Scalable and Elastic Deterministic Streaming Analysis with Virtual Shared-Nothing Parallelism.
12. Modeling the Performance of Atomic Primitives on Modern Architectures.
13. MindTheStep-AsyncPSGD: Adaptive Asynchronous Parallel Stochastic Gradient Descent.
14. MAD-C: Multi-stage Approximate Distributed Cluster-Combining for Obstacle Detection and Localization.
15. Concurrent Linearizable Nearest Neighbour Search in LockFree-kD-tree.
16. Lock-Free Search Data Structures: Throughput Modeling with Poisson Processes.
17. Concurrent Lock-Free Unbounded Priority Queue with Mutable Priorities.
18. PARMA-CC: A family of parallel multiphase approximate cluster combining algorithms
19. Scalable Lock-Free Vector with Combining.
20. Viper: Communication-Layer Determinism and Scaling in Low-Latency Stream Processing.
21. Performance Modeling of Stream Joins.
22. Maximizing Determinism in Stream Processing Under Latency Constraints.
23. Brief Announcement: 2D-Stack - A Scalable Lock-Free Stack Design that Continuously Relaxes Semantics for Better Performance.
24. STRETCH: Virtual Shared-Nothing Parallelism for Scalable and Elastic Stream Processing
25. Highly Concurrent Stream Synchronization in Many-core Embedded Systems.
26. Help-Optimal and Language-Portable Lock-Free Concurrent Data Structures.
27. Shared-object system equilibria: delay and throughput analysis.
28. How Lock-free Data Structures Perform in Dynamic Environments: Models and Analyses.
29. Lock-free Concurrent Data Structures and How to Model their Performance.
30. Modeling Energy Consumption of Lock-Free Queue Implementations.
31. A Consistency Framework for Iteration Operations in Concurrent Data Structures.
32. Analyzing the Performance of Lock-Free Data Structures: A Conflict-Based Model.
33. Scalejoin: A deterministic, disjoint-parallel and skew-resilient stream join.
34. Of Concurrent Data Structures and Iterations.
35. Data-Streaming and Concurrent Data-Object Co-design: Overview and Algorithmic Challenges.
36. Evaluation of message passing synchronization algorithms in embedded systems.
37. Concurrent Data Structures in Architectures with Limited Shared Memory Support.
38. A Graph-Based Analysis of Medical Queries of a Swedish Health Care Portal.
39. Efficient lock-free binary search trees.
40. Overlapping Communities for Identifying Misbehavior in Network Communications.
41. Self-stabilizing TDMA algorithms for wireless ad-hoc networks without external reference.
42. Lock-Free Cuckoo Hashing.
43. ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List.
44. A local seed selection algorithm for overlapping community detection.
45. A Study of the Behavior of Synchronization Methods in Commonly Used Languages and Systems.
46. Safe system-level concurrency on resource-constrained nodes.
47. Bridging Physical and Digital Traffic System Simulations with the Gulliver Test-Bed.
48. Self-stabilizing (k, r)-Clustering in Clock Rate-Limited Systems.
49. Understanding the Performance of Concurrent Data Structures on Graphics Processors.
50. An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.