1603 search results - page 260 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
TCC
2009
Springer
15 years 10 months ago
2009
Springer
The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...
107
click to vote
ICS
2009
Tsinghua U.
15 years 4 months ago
2009
Tsinghua U.
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...
107
click to vote
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
ALMOB
2006
14 years 10 months ago
2006
Background: Bifurcation analysis has proven to be a powerful method for understanding the qualitative behavior of gene regulatory networks. In addition to the more traditional for...
94
Voted
WWW
2007
ACM
15 years 10 months ago
2007
ACM
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...