10447 search results - page 1945 / 2090 » The Philosophy of Computer Science |
183
click to vote
LICS
2009
IEEE
16 years 21 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 ...
129
click to vote
ATAL
2009
Springer
16 years 19 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...
152
click to vote
COCO
2009
Springer
16 years 19 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 ...
144
click to vote
COCO
2009
Springer
16 years 19 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...
161
click to vote
COCO
2009
Springer
16 years 19 days ago
2009
Springer
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...