Filters








54 Hits in 4.2 sec

An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs

Benjamin Birnbaum, Kenneth J. Goldman
2007 Algorithmica  
In this paper, we use the technique of factor revealing linear programs to prove that this algorithm actually achieves an approximation ratio of 2, matching the best-known ratio for the problem.  ...  In this paper, we use the technique of factor revealing linear programs to prove that this algorithm actually achieves an approximation ratio of 2, matching the best-known ratio for the problem.  ...  Finally, because it seems that the technique of factor-revealing LPs lends itself very naturally to remote-clique, it would be an interesting direction for future research to examine how it applies to  ... 
doi:10.1007/s00453-007-9142-2 fatcat:qej3nen6oren7kricw77dk3gpy

An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs [chapter]

Benjamin E. Birnbaum, Kenneth J. Goldman
2006 Lecture Notes in Computer Science  
In this paper, we use the technique of factor revealing linear programs to prove that this algorithm actually achieves an approximation ratio of 2, matching the best-known ratio for the problem.  ...  In this paper, we use the technique of factor revealing linear programs to prove that this algorithm actually achieves an approximation ratio of 2, matching the best-known ratio for the problem.  ...  Finally, because it seems that the technique of factor-revealing LPs lends itself very naturally to remote-clique, it would be an interesting direction for future research to examine how it applies to  ... 
doi:10.1007/11830924_7 fatcat:5knrekvkl5chnksghfsth6zvqi

Path Formation in Human Contact Networks [chapter]

Nishanth Sastry, Pan Hui
2011 Handbook of Optimization in Complex Networks  
For an ecological community, the idea of correlated interaction means that an organism of a given type is more likely to interact with another organism of the same type than with a randomly chosen member  ...  We need an algorithm which can cope with dynamic, repeated disconnection and re-wiring.  ...  This is exactly a combination of direct LABEL and greedy RANK, using greedy RANK to move the messages away from the source group.  ... 
doi:10.1007/978-1-4614-0857-4_12 fatcat:gltoxf7iebeujcg3xlhclsulry

Community detection in graphs

Santo Fortunato
2010 Physics reports  
Such clusters, or communities, can be considered as fairly independent compartments of a graph, playing a similar role like, e. g., the tissues or the organs in the human body.  ...  We will attempt a thorough exposition of the topic, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by  ...  Therefore the method is typically used to improve on the partitions found through other techniques, by using them as starting configurations for the algorithm.  ... 
doi:10.1016/j.physrep.2009.11.002 fatcat:4ehi6spclncgtevcwxwztmhw4y

A Clustering-Based Selective Probing Framework to Support Internet Quality of Service Routing [chapter]

Nattaphol Jariyakul, Taieb Znati
2005 Lecture Notes in Computer Science  
A thorough study to evaluate the performance of the proposed d-median clustering algorithm is conducted.  ...  DiffServ uses class-based service differentiation to achieve aggregate support for QoS requirements.  ...  [JAIN99] improved to factor of 6, using the Primal-Dual technique.  ... 
doi:10.1007/11603771_41 fatcat:m7ywyheribhqdbxqxlc37v44yi

Automatic Optimisation of Reliable Collaborative Services in OLSR Mobile Ad Hoc Networks

Christophe Guettier, Philippe Jacquet, Laurent Viennot, Jacques Yelloz
2007 MILCOM 2007 - IEEE Military Communications Conference  
We make use of the specific parameter MPR-COVERAGE in the Multiple Relay Selection algorithm in order to conserve 2-connectivity.  ...  Following a constraint solving method, the paper shows how to maximise a subnet of actors involved in a given collaborative service, while satisfying 2-connectivity, reactivity and communication quality  ...  A simple greedy algorithm allows to find MPR sets with small size [?] .  ... 
doi:10.1109/milcom.2007.4454993 fatcat:mdyjfwrt5nb3bljwzk7gkkbkye

Associate Editors-in-Chief

2014 Acta Geologica Sinica (English)  
We thank the SocioPatterns collaboration for providing privileged access to the SocioPatterns sensing platform.  ...  Acknowledgements This work was supported by the VENUS research cluster at the interdisciplinary Research Center for Information System Design (ITeG) at Kassel University and by the EU-project EveryAware  ...  It uses extended graph factorization for detecting (global) community allocations in a timevariant analysis.  ... 
doi:10.1111/1755-6724.12260 fatcat:ffjz4kvnqnavzeipqzyladsyyu

Associate Editors-in-Chief [chapter]

2012 International Encyclopedia of Housing and Home  
We thank the SocioPatterns collaboration for providing privileged access to the SocioPatterns sensing platform.  ...  Acknowledgements This work was supported by the VENUS research cluster at the interdisciplinary Research Center for Information System Design (ITeG) at Kassel University and by the EU-project EveryAware  ...  It uses extended graph factorization for detecting (global) community allocations in a timevariant analysis.  ... 
doi:10.1016/b978-0-08-047163-1.09002-0 fatcat:t3rt56yjb5bwfnn5ttrcx3g2dy

FatPaths: Routing in Supercomputers and Data Centers when Shortest Paths Fall Short [article]

Maciej Besta, Marcel Schneider, Karolina Cynk, Marek Konieczny, Erik Henriksson, Salvatore Di Girolamo, Ankit Singla, Torsten Hoefler
2020 arXiv   pre-print
Moreover, FatPaths uses a redesigned "purified" transport layer that removes virtually all TCP performance issues (e.g., the slow start), and incorporates flowlet switching, a technique used to prevent  ...  FatPaths will significantly accelerate Ethernet clusters that form more than 50% of the Top500 list and it may become a standard routing scheme for modern topologies.  ...  We thank Nils Blach, Alessandro Maisen, and Adam Latos for useful comments that helped improve the quality of the paper.  ... 
arXiv:1906.10885v2 fatcat:b6blvp46gbd6npe3p7c2w4a57a

Implementation of Fog computing for reliable E-health applications

Razvan Craciunescu, Albena Mihovska, Mihail Mihaylov, Sofoklis Kyriazakos, Ramjee Prasad, Simona Halunga
2015 2015 49th Asilomar Conference on Signals, Systems and Computers  
Finally, we will provide 'structured' CS algorithms for the joint estimation scheme and evaluate its performance.  ...  In this work we explore some of the potential fiber-optic data transmission applications of the nonlinear Fourier transform (NFT), a signal analysis technique introduced by mathematicians and physicists  ...  In this paper, an iterative greedy algorithm is proposed that combines mismatched filtering with matching pursuit algorithm.  ... 
doi:10.1109/acssc.2015.7421170 dblp:conf/acssc/CraciunescuMMKP15 fatcat:qm6mki5z6bcvrfimkmqjyrxaxm

Ping-pong beam training for reciprocal channels with delay spread

Elisabeth de Carvalho, Jorgen Bach Andersen
2015 2015 49th Asilomar Conference on Signals, Systems and Computers  
In this paper, we conduct sensitive analysis of the optimized waveforms used in a MIMO-MC scenario in which targets fall in different range bins.  ...  For a network where nodes must empty a queue in minimum time the use of CoF can outperform a traditional TDMA approach.  ...  In this paper, an iterative greedy algorithm is proposed that combines mismatched filtering with matching pursuit algorithm.  ... 
doi:10.1109/acssc.2015.7421451 dblp:conf/acssc/CarvalhoA15 fatcat:mqokuvnh3zg45licnfbgxyvxfu

Proceedings of the third "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'16) [article]

V. Abrol, O. Absil, P.-A. Absil, S. Anthoine, P. Antoine, T. Arildsen, N. Bertin, F. Bleichrodt, J. Bobin, A. Bol, A. Bonnefoy, F. Caltagirone, V. Cambareri (+47 others)
2016 arXiv   pre-print
sparse problems; Sparse machine learning and inference; "Blind" inverse problems and dictionary learning; Optimization for sparse modelling; Information theory, geometry and randomness; Sparsity?  ...  channel estimation, astronomy); Application of sparse models in non-convex/non-linear inverse problems (e.g., phase retrieval, blind deconvolution, self calibration); Approximate probabilistic inference for  ...  Bruno Cornelis for registering the data sets and for useful discussions and also to Attila Fesus, Prof. Maximiliaan Martens and Prof.  ... 
arXiv:1609.04167v1 fatcat:cral5owpqremninl43bksxvenu

The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping

Berit D. Brouer, Jakob Dirksen, David Pisinger, Christian E.M. Plum, Bo Vaaben
2013 European Journal of Operational Research  
We propose a divisible load model and give an algorithm for scheduling multilayer divisible computations. The algorithm is tested experimentally.  ...  The problem is framed as a multi-indicator assessment and is solved using a minimal cost objective.  ...  -Optimal Dynamic Tax Evasion: A Portfolio Approach Francesco Menoncin, Economics, Brescia University, Via S. Faustino, 74/B, 25122, Brescia, Italy, menoncin@eco.unibs.it, Rosella Levaggi  ... 
doi:10.1016/j.ejor.2012.08.016 fatcat:c27kagfnxnhjfbil2rydhjhomm

Paradigms for Algorithms and Interactions [chapter]

Andrea Zanella, Michele Zorzi, Elena Fasolo, Anibal Ollero, Ivan Maza, Antidio Viguria, Marcelo Pias, George Coulouri, Chiara Petrioli
2010 Cooperating Embedded Systems and Wireless Sensor Networks  
Embedded WiSeNts Paradigms for algorithms and interactions  ...  This document provides a survey of the most important design paradigms, algorithms and interaction patterns that characterize the systems based on Cooperating Objects.  ...  Use the Greedy algorithm to assign the remaining tasks in an online fashion, as the robots become available.  ... 
doi:10.1002/9780470610817.ch3 fatcat:y6rg4ciutvelxkwt72fhwzdyd4

Decomposition and reformulation of integer linear programming problems

Fabio Furini
2011 4OR  
for use in DWR by a suitable use of (hyper-)graph partitioning algorithms  ...  Initial Heuristic A heuristic algorithm for MS2DCSP is used to provide an initial feasible solution to the problem in a very short computing time.  ... 
doi:10.1007/s10288-011-0178-4 fatcat:cp6c7sxqg5gudftye4ek5bedo4
« Previous Showing results 1 — 15 out of 54 results