2735 search results - page 35 / 547 » Comparing notions of randomness |
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— We define the concept of approximate domain optimizer for deterministic and expected value optimization criteria. Roughly speaking, a candidate optimizer is an approximate dom...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
WDAG
2005
Springer
14 years 1 months ago
2005
Springer
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
FASE
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Container classes such as lists, sets, or maps are elementary data structures common to many programming languages. Since they are a part of standard libraries, they are ...
TIT
2011
13 years 2 months ago
2011
The general problem of defining and determining the sample distribution in the case of continuousparameter random fields, is addressed. Defining a distribution in the case of d...