994 search results - page 47 / 199 » Custom Computing Machines for the Set Covering Problem |
117
Voted
EUROGP
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...
121
Voted
ESANN
2004
15 years 2 months ago
2004
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
234
Voted
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
107
click to vote
SIAMCOMP
1998
15 years 13 days ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
89
Voted
APPROX
2004
Springer
15 years 6 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...