1871 search results - page 225 / 375 » The Ephemeral Pairing Problem |
183
click to vote
ICPR
2010
IEEE
15 years 11 months ago
2010
IEEE
This paper introduces a geometrically inspired large-margin classifier that can be a better alternative to the Support Vector Machines (SVMs) for the classification problems with ...
216
click to vote
DAWAK
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
179
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
161
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In this research, we compare four different evaluation methods in coevolution on the Majority Function problem. The size of the problem is selected such that an evaluation against...
213
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...