Filters








255,413 Hits in 7.4 sec

New Tools and Connections for Exponential-time Approximation [article]

Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof
2017 arXiv   pre-print
In this paper, we develop new tools and connections for exponential time approximation.  ...  For obtaining the first two results, we introduce a new randomized branching rule. Finally, we show a connection between PCP parameters and exponential-time approximation algorithms.  ...  PCP Parameters and Exponential-time approximation hardness Exponential-time approximation has connections to the trade-off questions between three parameters of PCPs: size, freebit, and gap.  ... 
arXiv:1708.03515v1 fatcat:32ntmuwzhfd7dfkd4qv3orf45q

New Tools and Connections for Exponential-Time Approximation

Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof
2018 Algorithmica  
In this paper, we develop new tools and connections for exponential time approximation.  ...  To obtain the first two results, we introduce a new randomized branching rule. Finally, we show a connection between PCP parameters and exponential-time approximation algorithms.  ...  PCP Parameters and Exponential-Time Approximation Hardness Exponential-time approximation has connections to the trade-off questions between three parameters of PCPs: size, freebit, and gap.  ... 
doi:10.1007/s00453-018-0512-8 pmid:31496549 pmcid:PMC6710224 fatcat:x4dv6gw3dfecviyiph52qtxrue

Simulation of Generalised Semi-Markov Processes based on Graph Transformation Systems

Piotr Kosiuczenko, Georgios Lajios
2007 Electronical Notes in Theoretical Computer Science  
The new model is implemented and used to simulate simple networks.  ...  Existing approaches are restricted to processes with exponential time distribution.  ...  Karsten Ehrig and Olga Runge helped us with AGG. Many thanks to all of them.  ... 
doi:10.1016/j.entcs.2007.04.018 fatcat:2gq2ipc4ebb5dj5bfynwbym52m

Page 8900 of Mathematical Reviews Vol. , Issue 2000m [page]

2000 Mathematical Reviews  
there exists an algorithm running in time O(nT(n)) and achieving differential-approximation ratio 2—p for bin-packing.  ...  Summary: “The purpose of this paper is mainly to prove the following theorem: For every polynomial time algorithm run- ning in time 7(m) and guaranteeing standard-approximation ratio p for bin-packing,  ... 

On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms [chapter]

Celso C. Ribeiro, Isabel Rosseti, Reinaldo Vallejos
2009 Lecture Notes in Computer Science  
We further explore run time distributions and describe a new tool to compare two algorithms based on stochastic local search.  ...  Run time distributions or time-to-target plots are very useful tools to characterize the running times of stochastic algorithms for combinatorial optimization.  ...  This new tool and the resulting probability index revealed themselves as very promising and provide a new, additional measure for comparing the performance of stochastic local search algorithms or different  ... 
doi:10.1007/978-3-642-03751-1_2 fatcat:4aw62ym3prh53cxynd4ce3mfnq

Dynamic Facility Location via Exponential Clocks [article]

Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson
2014 arXiv   pre-print
We present a new LP-rounding algorithm for facility location problems, which yields the first constant approximation algorithm for the dynamic facility location problem.  ...  Our algorithm installs competing exponential clocks on the clients and facilities, and connect every client by the path that repeatedly follows the smallest clock in the neighborhood.  ...  We thank Claire Mathieu for inspiring discussions and the anonymous reviewers of the conference version of this paper for their helpful comments.  ... 
arXiv:1411.4476v1 fatcat:q46vb5ozyffe5dsxqitx3he7ae

Dynamic Facility Location via Exponential Clocks [chapter]

Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson
2014 Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms  
We present a new LP-rounding algorithm for facility location problems, which yields the first constant approximation algorithm for the dynamic facility location problem.  ...  Our algorithm installs competing exponential clocks on the clients and facilities, and connect every client by the path that repeatedly follows the smallest clock in the neighborhood.  ...  We thank Claire Mathieu for inspiring discussions and the anonymous reviewers of the conference version of this paper for their helpful comments.  ... 
doi:10.1137/1.9781611973730.48 dblp:conf/soda/AnNS15 fatcat:psriod3irrhrdmj37j74wyipwa

Fast filtering and animation of large dynamic networks

Przemyslaw A Grabowicz, Luca Maria Aiello, Filippo Menczer
2014 EPJ Data Science  
The algorithm is an approximation of exponential sliding time-window that scales linearly with the number of interactions.  ...  We compare the algorithm against rectangular and exponential sliding time-window methods.  ...  Acknowledgements We are grateful to André Panisson for inspiration and to Jacob Ratkiewicz, Bruno Gonçalves, Mark Meiss, and other members of the Truthy project (cnets.indiana.edu/groups/nan/truthy) for  ... 
doi:10.1140/epjds/s13688-014-0027-8 fatcat:m4gpsl24nfgchdju5jh7v4bxwq

Calculation of traversing time distributions in semi-Markov chains with application on Petri Nets

Faruk Hadziomerovic
2013 2013 XXIV International Conference on Information, Communication and Automation Technologies (ICAT)  
The exact closed form solution is obtained for the negative exponential transitions (firing times) with or without one deterministic transition, and the approximate solution for the mix of negative exponential  ...  this paper shows how to obtain probability distribution of traversing time between initial and final states in Markov Chains underlying Petri Nets.  ...  The approximate closed form solutions are obtained for more than one deterministic transitions and their mix with the negative exponential transitions.  ... 
doi:10.1109/icat.2013.6684082 dblp:conf/icatech/Hadziomerovic13 fatcat:i5djyndqlnhwtc4osnhn4flodu

Demonstration of adjusting forward error correction with quality scaling for TCP-friendly streaming MPEG

Huahui Wu, Mark Claypool, Robert Kinicki
2004 Proceedings of the 12th annual ACM international conference on Multimedia - MULTIMEDIA '04  
Previous research shows the bitrate of a MPEG stream can be approximated by an exponential function of lq and our experiments suggest frame size can also be estimated by an exponential function of quantization  ...  Our results show the distortion D could be also approximated by an exponential function of the quantization level.  ...  The analytic calculations required by the search can be done in real-time, making the determination of optimal choices for adaptive FEC feasible for most streaming multimedia connections.  ... 
doi:10.1145/1027527.1027564 dblp:conf/mm/WuCK04 fatcat:5pb5ssfvwbhrre6zieuc2dbcwy

Ulam's Type Stability and Fixed Points Methods 2016

Janusz Brzdęk, Liviu Cădariu, Krzysztof Ciepliński, Ajda Fošner, Zbigniew Leśniak, Bing Xu
2016 Journal of Function Spaces  
It seems that it was used for the first time by J. A.  ...  Another two papers present some fixed point theorems for new types of contractive mappings: one in classical metric spaces and the other in dislocated metric spaces.  ...  It seems that it was used for the first time by J. A.  ... 
doi:10.1155/2016/7205848 fatcat:4cxs5fkvlvep3obhkgp47bgqbe

Kernel methods and the exponential family

Stéphane Canu, Alex Smola
2006 Neurocomputing  
Exponential families, a standard tool in statistics, can be used to unify many existing machine learning algorithms based on kernels (such as SVM) and to invent novel ones quite effortlessly.  ...  In this paper we will discuss how exponential families, a standard tool in statistics, can be used with great success in machine learning to unify many existing algorithms and to invent novel ones quite  ...  The exponential family framework is powerful because it allows to connect, with almost no lost of generality, learning algorithm with usual statistical tools such as posterior densities and likelihood  ... 
doi:10.1016/j.neucom.2005.12.009 fatcat:jdy6e4zcujgdzl7fro52ndlose

Interactive decal compositing with discrete exponential maps

Ryan Schmidt, Cindy Grimm, Brian Wyvill
2006 ACM SIGGRAPH 2006 Papers on - SIGGRAPH '06  
Tools for image processing, deformation/feature-matching, and vector graphics are implemented using direct surface interaction.  ...  The exponential map approximation can be computed on any point set, including meshes and sampled implicit surfaces, and is relatively stable under resampling.  ...  This work was funded by NSERC, iCore, and NSF grant 049856.  ... 
doi:10.1145/1179352.1141930 fatcat:2t3dspgatracxklxbzosdd43ju

Interactive decal compositing with discrete exponential maps

Ryan Schmidt, Cindy Grimm, Brian Wyvill
2006 ACM Transactions on Graphics  
Tools for image processing, deformation/feature-matching, and vector graphics are implemented using direct surface interaction.  ...  The exponential map approximation can be computed on any point set, including meshes and sampled implicit surfaces, and is relatively stable under resampling.  ...  This work was funded by NSERC, iCore, and NSF grant 049856.  ... 
doi:10.1145/1141911.1141930 fatcat:3iuvouspyjeo3mbg5xkdygutzy

WIT: A Wireless Integrated Traffic Model

Arta Doci, Fatos Xhafa
2008 Mobile Information Systems  
In addition, mobility and traffic tools are designed independently of each other, however real trace data challenge that assumption.  ...  In this paper we consider jointly both real mobility and traffic for protocol performance evaluation.  ...  The distributions of the extracted variables are log-normal for the pause time, exponential for the start/end times, and log-normal for speed (se Fig. 3 for the main building blocks).  ... 
doi:10.1155/2008/341498 fatcat:jls47o6ndrezjcu7rnlhybd3ly
« Previous Showing results 1 — 15 out of 255,413 results