1100 search results - page 34 / 220 » Approximate distance oracles |
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
126
Voted
FOCS
2008
IEEE
15 years 1 months ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
154
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Long-span language models that capture syntax and semantics are seldom used in the first pass of large vocabulary continuous speech recognition systems due to the prohibitive sea...
100
Voted
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
We define the class of games called simulation-based games, in which the payoffs are available as an output of an oracle (simulator), rather than specified analytically or using a...