Sciweavers

Share
WEA
2010
Springer
205views Algorithms» more  WEA 2010»
9 years 5 months ago
Practical Compressed Suffix Trees
Abstract. The suffix tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, w...
Rodrigo Cánovas, Gonzalo Navarro
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
9 years 5 months ago
Realtime Classification for Encrypted Traffic
Classifying network flows by their application type is the backbone of many crucial network monitoring and controlling tasks, including billing, quality of service, security and tr...
Roni Bar-Yanai, Michael Langberg, David Peleg, Lia...
WEA
2010
Springer
208views Algorithms» more  WEA 2010»
9 years 6 months ago
Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries
Umberto Ferraro Petrillo, Fabrizio Grandoni, Giuse...
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
10 years 1 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
10 years 1 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
10 years 1 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
WEA
2010
Springer
243views Algorithms» more  WEA 2010»
10 years 2 months ago
Experiments with a Feasibility Pump Approach for Nonconvex MINLPs
We present a new Feasibility Pump algorithm tailored for nonconvex Mixed Integer Nonlinear Programming problems. Differences with the previously proposed Feasibility Pump algorith...
Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti...
WEA
2010
Springer
397views Algorithms» more  WEA 2010»
10 years 2 months ago
A New Combinational Logic Minimization Technique with Applications to Cryptology
Abstract. A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuit – as measured ...
Joan Boyar, René Peralta
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
10 years 2 months ago
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
10 years 2 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
books