6142 search results - page 271 / 1229 » The Complexity of Partition Functions |
148
click to vote
ICPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Abstract—This work focuses on the scalability of the Evidence Accumulation Clustering (EAC) method. We first address the space complexity of the co-association matrix. The spars...
157
Voted
DCC
2006
IEEE
16 years 5 months ago
2006
IEEE
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
190
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
179
click to vote
ICIC
2009
Springer
16 years 21 days ago
2009
Springer
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...
149
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...