Sciweavers

4488 search results - page 132 / 898
» Properties of NP-Complete Sets
Sort
View
EJC
2008
13 years 8 months ago
Partitions and Clifford algebras
Given the set [n] = {1, . . . , n} for positive integer n, combinatorial properties of Clifford algebras are exploited to count partitions and nonoverlapping partitions of [n]. Th...
René Schott, G. Stacey Staples
CPC
2006
56views more  CPC 2006»
13 years 8 months ago
Rayleigh Matroids
A Rayleigh matroid is one which satisfies a set of inequalities analogous to the Rayleigh monotonicity property of linear resistive electrical networks. We show that every matroid...
Youngbin Choe, David G. Wagner
DC
2000
13 years 8 months ago
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
Anna Pogosyants, Roberto Segala, Nancy A. Lynch
ALT
2005
Springer
14 years 5 months ago
An Analysis of the Anti-learning Phenomenon for the Class Symmetric Polyhedron
This paper deals with an unusual phenomenon where most machine learning algorithms yield good performance on the training set but systematically worse than random performance on th...
Adam Kowalczyk, Olivier Chapelle
GRC
2007
IEEE
14 years 2 months ago
MGRS in Incomplete Information Systems
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on the universe. In the view of granular computing, classica...
Yuhua Qian, Jiye Liang, Chuangyin Dang