3946 search results - page 173 / 790 » The computational complexity of choice sets |
164
click to vote
IEEEICCI
2007
IEEE
16 years 27 days ago
2007
IEEE
Granular computing concerns human thinking and problem solving, as well as their implications to the design of knowledge intensive systems. It simplifies complex real world probl...
158
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
A framework for the regularized estimation of nonuniform dimensionality and density in high dimensional data is introduced in this work. This leads to learning stratifications, th...
152
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
175
click to vote
ECAL
2007
Springer
16 years 23 days ago
2007
Springer
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to c...
182
click to vote
WG
2005
Springer
16 years 2 days ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...