5624 search results - page 67 / 1125 » On Conditional Covering Problem |
208
click to vote
DCOSS
2008
Springer
15 years 8 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
153
click to vote
ICIP
2006
IEEE
16 years 7 months ago
2006
IEEE
The primary goal of image steganography techniques has been to maximize embedding rate while minimizing the detectability of the resulting stego images against steganalysis techni...
154
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
164
click to vote
EVOW
2005
Springer
15 years 11 months ago
2005
Springer
In this work, we address the biclustering of gene expression data with evolutionary computation, which has been proven to have excellent performance on complex problems. In express...
177
click to vote
ICML
2000
IEEE
15 years 10 months ago
2000
IEEE
We propose a new rule induction algorithm for solving classification problems via probability estimation. The main advantage of decision rules is their simplicity and good interp...