9532 search results - page 448 / 1907 » Logic, Graphs, and Algorithms |
202
click to vote
DLOG
2006
15 years 8 months ago
2006
Fuzzy Description Logics have been proposed in the literature as a way to represent and reason with vague and imprecise knowledge. Their decidability, the empirically tractable an...
168
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
203
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...
170
click to vote
DAWAK
2007
Springer
16 years 1 months ago
2007
Springer
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
155
click to vote
JDA
2006
15 years 6 months ago
2006
The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial (2n) algorithm which enumerates and checks all the subsets of