21 search results - page 3 / 5 » Sharpness Rules |
IGPL
2006
13 years 6 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
KDD
1998
ACM
13 years 10 months ago
1998
ACM
We consider the problem of nding rules relating patterns in a time series to other patterns in that series, or patterns in one series to patterns in another series. A simple examp...
INFOCOM
2009
IEEE
14 years 27 days ago
2009
IEEE
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
NN
2000
Springer
13 years 6 months ago
2000
Springer
Support vector (SV) machines are useful tools to classify populations characterized by abrupt decreases in density functions. At least for one class of Gaussian data model the SV ...
ECCV
2006
Springer
14 years 8 months ago
2006
Springer
Diffusion processes driven by anisotropic diffusion tensors are known to be well-suited for structure-preserving denoising. However, numerical implementations based on finite diffe...