16404 search results - page 2605 / 3281 » A set coverage problem |
171
click to vote
ESA
2004
Springer
16 years 19 days ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
189
click to vote
EUROCRYPT
2004
Springer
16 years 19 days ago
2004
Springer
Given two or more parties possessing large, confidential datasets, we consider the problem of securely computing the kth -ranked element of the union of the datasets, e.g. the med...
172
click to vote
EVOW
2004
Springer
16 years 19 days ago
2004
Springer
Abstract. In this paper we analyze two proteomic pattern datasets containing measurements from ovarian and prostate cancer samples. In particular, a linear and a quadratic support ...
197
click to vote
EWCBR
2004
Springer
16 years 19 days ago
2004
Springer
Textual CBR systems solve problems by reusing experiences that are in textual form. Knowledge-rich comparison of textual cases remains an important challenge for these systems. How...
164
click to vote
FIDJI
2004
Springer
16 years 19 days ago
2004
Springer
Abstract. When dealing with distributed systems, one of the most important problems that has to be addressed is concurrency. Distributed systems are inherently concurrent, distribu...