Filters








6,264 Hits in 4.4 sec

Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices [article]

Sergiy Bogomolov, Marcelo Forets, Goran Frehse, Andreas Podelski, Christian Schilling, Frédéric Viry
2018 arXiv   pre-print
Our method is applicable both in dense- and discrete-time settings.  ...  For the dense-time case, we show an experiment with more than 10.000 variables, roughly two orders of magnitude higher than possible with previous approaches.  ...  The analysis scales to systems with tens of thousands of variables, which are out of scope of state-of-the-art tools for dense-time reachability.  ... 
arXiv:1801.09526v1 fatcat:3vf22wugefcbpojbanzqacljui

Exact real arithmetic: a case study in higher order programming

Hans-J. Boehm, Robert Cartwright, Mark Riggle, Michael J. O'Donnell
1986 Proceedings of the 1986 ACM conference on LISP and functional programming - LFP '86  
Two methods for implementing ezact real arithmetic are explored One method is based on formulating real numbers as functions that map rational tolerances to rational approximations.  ...  We conclude wtth some general observations about the lazy evaluation paradigm and its implementation.  ...  reals.  ... 
doi:10.1145/319838.319860 fatcat:g62gawqesventgqi3ztaaa5vw4

Implicit Coordination of Caches in Small Cell Networks under Unknown Popularity Profiles

Giovanni Neglia
2018 Proceedings of the 2018 on Technologies for the Wireless Edge Workshop - WirelessEdge '18  
Our approach builds upon the well known characteristic time approximation [1] and provides predictions that are surprisingly accurate (hardly distinguishable from the simulations) in most of the scenarios  ...  We focus on a dense cellular network, in which a limited-size cache is available at every Base Station (BS).  ...  Under our approximated model, system dynamics are described by F Markov chains, one for each content, coupled by the characteristic times.  ... 
doi:10.1145/3266276.3266282 dblp:conf/mobicom/Neglia18 fatcat:llflg2jc6zgrxptit6xhzqqmju

Implicit Coordination of Caches in Small Cell Networks under Unknown Popularity Profiles [article]

Emilio Leonardi, Giovanni Neglia
2018 arXiv   pre-print
Our approach builds upon the well known characteristic time approximation and provides predictions that are surprisingly accurate (hardly distinguishable from the simulations) in most of the scenarios.  ...  We focus on a dense cellular network, in which a limited-size cache is available at every Base Station (BS).  ...  Under our approximated model, system dynamics are described by F Markov chains, one for each content, coupled by the characteristic times.  ... 
arXiv:1804.01895v2 fatcat:i456vccfb5gtpm656l24qgguu4

Implicit Coordination of Caches in Small Cell Networks under Unknown Popularity Profiles

Emilio Leonardi, Giovanni Neglia
2018 IEEE Journal on Selected Areas in Communications  
Our approach builds upon the well known characteristic time approximation [1] and provides predictions that are surprisingly accurate (hardly distinguishable from the simulations) in most of the scenarios  ...  We focus on a dense cellular network, in which a limited-size cache is available at every Base Station (BS).  ...  Under our approximated model, system dynamics are described by F Markov chains, one for each content, coupled by the characteristic times.  ... 
doi:10.1109/jsac.2018.2844982 fatcat:i55k6v446rdnllahcsnvraq66y

NEFOS: Rapid Cache-Aware Range Query Processing with Probabilistic Guarantees [chapter]

Spyros Sioutas, Kostas Tsichlas, Ioannis Karydis, Yannis Manolopoulos, Yannis Theodoridis
2011 Lecture Notes in Computer Science  
Also, it is the first time an expected sub-logarithmic bound for search operation was achieved for a broad family of non-smooth input distributions.  ...  This holds for a variety of real-life non-smooth distributions like skew, zipfian, powlaw, beta e.t.c.. The latter is also verified by an accompanying experimental study.  ...  , especially in database systems.  ... 
doi:10.1007/978-3-642-23088-2_5 fatcat:2f6iiorwr5hs5mup5bmbjpx3oi

Scalable Memory Use in MPI: A Case Study with MPICH2 [chapter]

David Goodell, William Gropp, Xin Zhao, Rajeev Thakur
2011 Lecture Notes in Computer Science  
In fact, some researchers believe that existing MPI implementations, if used unchanged, will themselves consume a large fraction of the available system memory at exascale.  ...  At this modest scale MPI memory consumption is reduced in the Lazy approach by approximately 550 bytes per process (≈ 11%), at a cost of less than 5% in performance.  ...  Roadmaps for future systems indicate that we can expect systems with many millions of cores over the next 5-10 years.  ... 
doi:10.1007/978-3-642-24449-0_17 fatcat:bbn4im56s5df3nptucuoxlmtie

Non-Volatile Memory Trends: Toward Improving Density and Energy Profiles across the System Stack

Ronald F. DeMara, Paolo Montuschi
2018 Computer  
Please stay tuned for the newest issues of TC to keep current on these advances in memory, as well as in computing architectures, secure and real-time systems, and much more.  ...  For instance, storage subsystems in mobile processors can revise protocols for swapping with faster, byte-addressable NVM to support lazy swap-in.  ... 
doi:10.1109/mc.2018.2141044 fatcat:d5s3aoj3h5e5dgjxmyphidjh3m

Learning Multivariate Hawkes Processes at Scale [article]

Maximilian Nickel, Matthew Le
2020 arXiv   pre-print
Multivariate Hawkes Processes (MHPs) are an important class of temporal point processes that have enabled key advances in understanding and predicting social information systems.  ...  By exploiting a characteristic sparsity pattern in real-world diffusion processes, we show that our approach allows to compute the exact likelihood and gradients of an MHP -- independently of the ambient  ...  For Memetracker, it can be seen that even for the most dense sequences, less than 10% of all entities are active and for the vast majority of sequences it is even less than 0.001%.  ... 
arXiv:2002.12501v1 fatcat:wejfmlqucnaqdhuib4bodqq5rq

Biological Network Visualization for Targeted Proteomics Based on Mean First-Passage Time in Semi-Lazy Random Walks [chapter]

Tomasz Arodz
2020 Lecture Notes in Computer Science  
We solve the problem by defining a semi-lazy random walk in directed graphs, and quantifying the mean first-passage time for graph nodes.  ...  Using simulated and real networks and data, we show that the graph connectivity structure inferred by the proposed method has higher agreement with underlying biology than two alternative strategies.  ...  system [26] .  ... 
doi:10.1007/978-3-030-50420-5_40 fatcat:pvxtlvhoyfhdzk2hocgzeoyvwy

A Cost-based Optimizer for Gradient Descent Optimization

Zoi Kaoudi, Jorge-Arnulfo Quiane-Ruiz, Saravanan Thirumuruganathan, Sanjay Chawla, Divy Agrawal
2017 Proceedings of the 2017 ACM International Conference on Management of Data - SIGMOD '17  
Extensive experiments on real and synthetic datasets show that our optimizer not only chooses the best GD plan but also allows for optimizations that achieve orders of magnitude performance speed-up.  ...  Ideally, a user will specify an ML task in a high-level and easy-to-use language and the framework will invoke the appropriate algorithms and system configurations to execute it.  ...  The real datasets are from LIBSVM 3 . We used eleven synthetic dense datasets for SVM of varying size and dimensionality to stress the scalability of the system.  ... 
doi:10.1145/3035918.3064042 dblp:conf/sigmod/KaoudiQTCA17 fatcat:peqngom2z5gibd7wfbiskbccxy

Clustered linear regression

Bertan Ari, H.Altay Güvenir
2002 Knowledge-Based Systems  
Second assumption is that there are some linear approximations for this function in each subspace.  ...  In other case, each new subspace will have a better ®tting linear approximation. However, this will cause over ®tting and gives less accurate results for the test instances.  ...  On the other hand, in lazy learning methods, all the work is done during testing, so they require much longer test times.  ... 
doi:10.1016/s0950-7051(01)00154-x fatcat:q7lvojntzjcphcoj3rd4gsaycq

Adaptively Informed Trees (AIT*): Fast Asymptotically Optimal Path Planning through Adaptive Heuristics [article]

Marlin P. Strub, Jonathan D. Gammell
2020 arXiv   pre-print
Informed sampling-based planning algorithms exploit problem knowledge for better search performance.  ...  Heuristics applicable to an entire problem domain are often simple to define and inexpensive to evaluate but may not be beneficial for a specific problem instance.  ...  System [7] .  ... 
arXiv:2002.06599v2 fatcat:nvsgsamp7rdrtby6rfyd2ywypq

Efficient ray tracing of subdivision surfaces using tessellation caching

Carsten Benthin, Sven Woop, Matthias Nießner, Kai Selgard, Ingo Wald
2015 Proceedings of the 7th Conference on High-Performance Graphics - HPG '15  
A 60MB lazy-build cache allows for rendering this scene with over 91% of the performance of an unbounded memory cache.  ...  using our efficient lazy-build caching scheme.  ...  We also thank Angela Dai for the video voice over.  ... 
doi:10.1145/2790060.2790061 dblp:conf/egh/BenthinWNSW15 fatcat:fdagy6hryjhptfe5x6fcp5njbe

Towards data center self-diagnosis using a mobile robot

Jonathan Lenchner, Canturk Isci, Jeffrey O. Kephart, Christopher Mansley, Jonathan Connell, Suzanne McIntosh
2011 Proceedings of the 8th ACM international conference on Autonomic computing - ICAC '11  
Through a series of real experiments and simulations, we establish that the robot is sufficiently accurate, efficient and robust to be of practical benefit in real data center environments.  ...  We demonstrate how the robot's integration with Maximo for Energy Optimization, a commercial data center energy management product, supports autonomic management at the level of the data center as a whole  ...  This allows MEO to update its rendering of the layout and the temperature distribution in near real-time, as its knowledge of both continues to grow.  ... 
doi:10.1145/1998582.1998597 dblp:conf/icac/LenchnerIKMCM11 fatcat:5y6l5tks2ngblawqcgcbolwnra
« Previous Showing results 1 — 15 out of 6,264 results