2107 search results - page 262 / 422 » Computing Small Search Numbers in Linear Time |
IWOCA
2009
Springer
14 years 3 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
Finding a small set of representative instances for large datasets can bring various benefits to data mining practitioners so they can (1) build a learner superior to the one cons...
PODS
2005
ACM
14 years 9 months ago
2005
ACM
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
STACS
2005
Springer
14 years 2 months ago
2005
Springer
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...