224 search results - page 4 / 45 » G-graphs for the cage problem: a new upper bound |
177
click to vote
AAAI
2006
15 years 7 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
172
click to vote
SPAA
2006
ACM
16 years 58 min ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
177
click to vote
COMPGEOM
1996
ACM
15 years 10 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
158
click to vote
IWPEC
2009
Springer
16 years 18 days ago
2009
Springer
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
172
click to vote
TIT
2010
15 years 23 days ago
2010
This is the first part of a two-part paper on information-theoretically secure secret key agreement. In this part, we study the secrecy problem under the widely studied source mod...