4298 search results - page 196 / 860 » Measurable chromatic numbers |
170
click to vote
RSFDGRC
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. Association rule algorithms often generate an excessive number of rules, many of which are not significant. It is difficult to determine which rules are more useful, int...
160
click to vote
ITNG
2010
IEEE
15 years 11 months ago
2010
IEEE
A number of routing metrics have been proposed to select a path with better performance in wireless mesh networks. Most of them partially rely on link loss rates when evaluating t...
175
click to vote
ACMSE
2000
ACM
15 years 11 months ago
2000
ACM
We present the background and justi cation for a new approachto studying computation and computational complexity. We focus on categories of problems and categories of solutions w...
175
click to vote
UAI
2008
15 years 8 months ago
2008
Exemplar-based clustering methods have been shown to produce state-of-the-art results on a number of synthetic and real-world clustering problems. They are appealing because they ...
164
click to vote
IJCAI
1993
15 years 7 months ago
1993
In this paper a framework is developed for measuring the complexities of deductions in an ab stract and computationally perspicuous man ner. As a notion of central importance ...