11395 search results - page 2138 / 2279 » Beyond computer science |
186
click to vote
LICS
2009
IEEE
16 years 27 days ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
131
click to vote
ATAL
2009
Springer
16 years 25 days ago
2009
Springer
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
157
click to vote
COCO
2009
Springer
16 years 25 days ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
145
click to vote
COCO
2009
Springer
16 years 25 days ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
206
click to vote
COCO
2009
Springer
16 years 25 days ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...