14379 search results - page 2619 / 2876 » is 2000 |
179
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process cra...
203
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
178
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...
175
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
159
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...