↓ Skip to main content

Experimental Algorithms

Overview of attention for book
Cover of 'Experimental Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Experimental Study of Resilient Algorithms and Data Structures
  3. Altmetric Badge
    Chapter 2 Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs
  4. Altmetric Badge
    Chapter 3 Alternative Routes in Road Networks
  5. Altmetric Badge
    Chapter 4 Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks
  6. Altmetric Badge
    Chapter 5 Space-Efficient SHARC-Routing
  7. Altmetric Badge
    Chapter 6 A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation
  8. Altmetric Badge
    Chapter 7 Contraction of Timetable Networks with Realistic Transfers
  9. Altmetric Badge
    Chapter 8 Distributed Time-Dependent Contraction Hierarchies
  10. Altmetric Badge
    Chapter 9 Practical Compressed Suffix Trees
  11. Altmetric Badge
    Chapter 10 Maximum Cliques in Protein Structure Comparison
  12. Altmetric Badge
    Chapter 11 Exact Bipartite Crossing Minimization under Tree Constraints
  13. Altmetric Badge
    Chapter 12 Bit-Parallel Search Algorithms for Long Patterns
  14. Altmetric Badge
    Chapter 13 Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
  15. Altmetric Badge
    Chapter 14 Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway Cars
  16. Altmetric Badge
    Chapter 15 Time-Dependent Contraction Hierarchies and Approximation
  17. Altmetric Badge
    Chapter 16 A New Combinational Logic Minimization Technique with Applications to Cryptology
  18. Altmetric Badge
    Chapter 17 Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
  19. Altmetric Badge
    Chapter 18 The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm
  20. Altmetric Badge
    Chapter 19 An Approximate ε -Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem
  21. Altmetric Badge
    Chapter 20 A Branch-and-Price Algorithm for Multi-mode Resource Leveling
  22. Altmetric Badge
    Chapter 21 Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
  23. Altmetric Badge
    Chapter 22 Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
  24. Altmetric Badge
    Chapter 23 Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation
  25. Altmetric Badge
    Chapter 24 New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
  26. Altmetric Badge
    Chapter 25 A Metaheuristic for a Two Echelon Location-Routing Problem
  27. Altmetric Badge
    Chapter 26 New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint
  28. Altmetric Badge
    Chapter 27 An Experimental Comparison of Different Heuristics for the Master Bay Plan Problem
  29. Altmetric Badge
    Chapter 28 An Analysis of Heuristics for Vertex Colouring
  30. Altmetric Badge
    Chapter 29 Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm
  31. Altmetric Badge
    Chapter 30 Experiments with a Feasibility Pump Approach for Nonconvex MINLPs
  32. Altmetric Badge
    Chapter 31 Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
  33. Altmetric Badge
    Chapter 32 Realtime Classification for Encrypted Traffic
  34. Altmetric Badge
    Chapter 33 Data Propagation with Guaranteed Delivery for Mobile Networks
  35. Altmetric Badge
    Chapter 34 Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries
  36. Altmetric Badge
    Chapter 35 Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
  37. Altmetric Badge
    Chapter 36 Policy-Based Benchmarking of Weak Heaps and Their Relatives,
  38. Altmetric Badge
    Chapter 37 Modularity-Driven Clustering of Dynamic Graphs
  39. Altmetric Badge
    Chapter 38 Gateway Decompositions for Constrained Reachability Problems
  40. Altmetric Badge
    Chapter 39 Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere
  41. Altmetric Badge
    Chapter 40 Fault Recovery in Wireless Networks: The Geometric Recolouring Approach
  42. Altmetric Badge
    Chapter 41 Geometric Minimum Spanning Trees with GeoFilterKruskal
  43. Altmetric Badge
    Chapter 42 Practical Nearest Neighbor Search in the Plane
Attention for Chapter 32: Realtime Classification for Encrypted Traffic
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age and source

Mentioned by

twitter
1 X user

Citations

dimensions_citation
5 Dimensions

Readers on

mendeley
83 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Realtime Classification for Encrypted Traffic
Chapter number 32
Book title
Experimental Algorithms
Published in
Lecture notes in computer science, May 2010
DOI 10.1007/978-3-642-13193-6_32
Book ISBNs
978-3-64-213192-9, 978-3-64-213193-6
Authors

Roni Bar - Yanai, Michael Langberg, David Peleg, Liam Roditty

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 83 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Sweden 1 1%
Canada 1 1%
Brazil 1 1%
Unknown 80 96%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 19 23%
Student > Master 19 23%
Researcher 10 12%
Student > Bachelor 8 10%
Student > Postgraduate 4 5%
Other 9 11%
Unknown 14 17%
Readers by discipline Count As %
Computer Science 58 70%
Engineering 6 7%
Business, Management and Accounting 1 1%
Chemistry 1 1%
Unspecified 1 1%
Other 0 0%
Unknown 16 19%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 14 November 2014.
All research outputs
#15,310,081
of 22,770,070 outputs
Outputs from Lecture notes in computer science
#4,646
of 8,123 outputs
Outputs of similar age
#76,270
of 94,301 outputs
Outputs of similar age from Lecture notes in computer science
#21
of 45 outputs
Altmetric has tracked 22,770,070 research outputs across all sources so far. This one is in the 22nd percentile – i.e., 22% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,123 research outputs from this source. They receive a mean Attention Score of 5.0. This one is in the 27th percentile – i.e., 27% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 94,301 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 11th percentile – i.e., 11% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 45 others from the same source and published within six weeks on either side of this one. This one is in the 37th percentile – i.e., 37% of its contemporaries scored the same or lower than it.