[PDF][PDF] Needle in a haystack: Mitigating content poisoning in named-data networking

C Ghali, G Tsudik, E Uzun - … of NDSS workshop on security of …, 2014 - sprout.ics.uci.edu
Named-Data Networking (NDN) is a candidate next-generation Internet architecture
designed to address some limitations of the current IP-based Internet. NDN uses the pull …

Best-first beam search

C Meister, T Vieira, R Cotterell - Transactions of the Association for …, 2020 - direct.mit.edu
Decoding for many NLP tasks requires an effective heuristic algorithm for approximating
exact search because the problem of searching the full output space is often intractable, or …

[图书][B] Handbook of data structures and applications

DP Mehta, S Sahni - 2004 - taylorfrancis.com
Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

DynamO: a free \calO (N) general event‐driven molecular dynamics simulator

MN Bannerman, R Sargant… - Journal of computational …, 2011 - Wiley Online Library
Molecular dynamics algorithms for systems of particles interacting through discrete or “hard”
potentials are fundamentally different to the methods for continuous or “soft” potential …

Efficient extraction of drainage networks from massive, radar-based elevation models with least cost path search

M Metz, H Mitasova, RS Harmon - Hydrology and Earth System …, 2011 - hess.copernicus.org
The availability of both global and regional elevation datasets acquired by modern remote
sensing technologies provides an opportunity to significantly improve the accuracy of stream …

Graspan: A single-machine disk-based graph system for interprocedural static analyses of large-scale systems code

K Wang, A Hussain, Z Zuo, G Xu… - ACM SIGARCH Computer …, 2017 - dl.acm.org
There is more than a decade-long history of using static analysis to find bugs in systems
such as Linux. Most of the existing static analyses developed for these systems are simple …

[图书][B] Lipschitz optimization

P Hansen, B Jaumard - 1995 - Springer
Lipschitz optimization solves global optimization problems in which the objective function
and constraint left-hand sides may be given by oracles (or explicitly) and have a bounded …

Correcting noisy OCR: Context beats confusion

J Evershed, K Fitch - Proceedings of the First International Conference …, 2014 - dl.acm.org
We describe a system for automatic post OCR text correction of digital collections of
historical texts. Documents, such as old newspapers, are often degraded, so even the best …

Global optimization of univariate Lipschitz functions: I. Survey and properties

P Hansen, B Jaumard, SH Lu - Mathematical programming, 1992 - Springer
We consider the following global optimization problems for a univariate Lipschitz function f
defined on an interval [a, b]: Problem P: find a globally optimal value of f and a …

Perfaugur: Robust diagnostics for performance anomalies in cloud services

S Roy, AC König, I Dvorkin… - 2015 IEEE 31st …, 2015 - ieeexplore.ieee.org
Cloud platforms involve multiple independently developed components, often executing on
diverse hardware configurations and across multiple data centers. This complexity makes …