2107 search results - page 230 / 422 » Computing Small Search Numbers in Linear Time |
ML
2002
ACM
13 years 9 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
Astronomy increasingly faces the issue of massive datasets. For instance, the Sloan Digital Sky Survey (SDSS) has so far generated tens of millions of images of distant galaxies, ...
EUROCRYPT
1997
Springer
14 years 27 days ago
1997
Springer
In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. It is the first scheme for which the ...
ALGORITHMICA
2007
13 years 9 months ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
ALGORITHMICA
2008
13 years 9 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...