Certifying algorithms
RM McConnell, K Mehlhorn, S Näher… - Computer Science …, 2011 - Elsevier
A certifying algorithm is an algorithm that produces, with each output, a certificate or witness
(easy-to-verify proof) that the particular output has not been compromised by a bug. A user …
(easy-to-verify proof) that the particular output has not been compromised by a bug. A user …
[图书][B] Data mining: the textbook
CC Aggarwal - 2015 - Springer
This textbook explores the different aspects of data mining from the fundamentals to the
complex data types and their applications, capturing the wide diversity of problem domains …
complex data types and their applications, capturing the wide diversity of problem domains …
[图书][B] Introduction to random graphs
A Frieze, M Karoński - 2015 - books.google.com
From social networks such as Facebook, the World Wide Web and the Internet, to the
complex interactions between proteins in the cells of our bodies, we constantly face the …
complex interactions between proteins in the cells of our bodies, we constantly face the …
Operational Research: methods and applications
Abstract Throughout its history, Operational Research has evolved to include methods,
models and algorithms that have been applied to a wide range of contexts. This …
models and algorithms that have been applied to a wide range of contexts. This …
A branch-and-cut algorithm for the vehicle routing problem with drones
Increasing online purchases and higher customer requirements in terms of speed, flexibility,
and costs of home deliveries are challenges to every company involved in last mile delivery …
and costs of home deliveries are challenges to every company involved in last mile delivery …
[图书][B] Approximation algorithms
VV Vazirani - 2001 - Springer
Although this may seem a paradox, all exact science is dominated by the idea of
approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including …
approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including …
Random sampling in cut, flow, and network design problems
DR Karger - Proceedings of the twenty-sixth annual ACM …, 1994 - dl.acm.org
We explore random sampling as a tool for solving undirected graph problems. We show that
the sparse graph, or skeleton, which arises when we randomly sample a graph's edges will …
the sparse graph, or skeleton, which arises when we randomly sample a graph's edges will …
Hyperspectral image clustering: Current achievements and future lines
Hyperspectral remote sensing organically combines traditional space imaging with
advanced spectral measurement technologies, delivering advantages stemming from …
advanced spectral measurement technologies, delivering advantages stemming from …
Minimum cuts in near-linear time
DR Karger - Journal of the ACM (JACM), 2000 - dl.acm.org
We significantly improve known time bounds for solving the minimum cut problem on
undirected graphs. We use a" semiduality" between minimum cuts and maximum spanning …
undirected graphs. We use a" semiduality" between minimum cuts and maximum spanning …
Two can keep a secret: A distributed architecture for secure database services
G Aggarwal, M Bawa, P Ganesan, H Garcia-Molina… - CIDR …, 2005 - ilpubs.stanford.edu
Recent trends towards database outsourcing, as well as concerns and laws governing data
privacy, have led to great interest in enabling secure database services. Previous …
privacy, have led to great interest in enabling secure database services. Previous …