4377 search results - page 362 / 876 » Mass problems and randomness |
212
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Many real life problems require the classification of items into naturally ordered classes. These problems are traditionally handled by conventional methods intended for the class...
194
click to vote
ESA
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
177
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
196
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
267
click to vote
PKC
2011
Springer
14 years 9 months ago
2011
Springer
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...