4908 search results - page 895 / 982 » On the Complexity of Optimal K-Anonymity |
106
click to vote
ATMOS
2007
15 years 1 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
117
click to vote
BIOCOMP
2008
15 years 1 months ago
2008
Background: Inferring a gene regulatory network (GRN) from high throughput biological data is often an under-determined problem and is a challenging task due to the following reas...
FAST
2007
15 years 1 months ago
2007
Abstract— Prefetching is a widely used technique in modern data storage systems. We study the most widely used class of prefetching algorithms known as sequential prefetching. Th...
102
click to vote
NSDI
2010
15 years 1 months ago
2010
Today, large-scale web services run on complex systems, spanning multiple data centers and content distribution networks, with performance depending on diverse factors in end syst...
120
click to vote
UAI
2008
15 years 1 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...