206 search results - page 5 / 42 » A nonblocking set optimized for querying the minimum value |
COLT
2010
Springer
13 years 5 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
JCO
2010
13 years 6 months ago
2010
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...
VLDB
2001
ACM
14 years 6 days ago
2001
ACM
In this paper we focus on the following problem in information management: given a large collection of recorded information and some knowledge of the process that is generating th...
SIGMOD
2010
ACM
14 years 18 days ago
2010
ACM
Parameterized queries are commonly used in database applications. In a parameterized query, the same SQL statement is potentially executed multiple times with different parameter ...
ALT
2008
Springer
14 years 4 months ago
2008
Springer
In this paper we consider the problem of learning hidden independent cascade social networks using exact value injection queries. These queries involve activating and suppressing a...