438 search results - page 38 / 88 » On Perfect Switching Classes |
ICIP
2006
IEEE
16 years 1 months ago
2006
IEEE
Consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, piecewise polynomi...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
PAKDD
2005
ACM
15 years 5 months ago
2005
ACM
We define sporadic rules as those with low support but high confidence: for example, a rare association of two symptoms indicating a rare disease. To find such rules using the w...
PAKDD
2004
ACM
15 years 5 months ago
2004
ACM
Computational diagnosis of cancer is a classification problem, and it has two special requirements on a learning algorithm: perfect accuracy and small number of features used in t...
WG
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we consider the recognition problem on two classes of perfectly orderable graphs, namely, the HHD-free and the Welsh-Powell opposition graphs (or WPO-graphs). In par...