1272 search results - page 60 / 255 » The Set Cover with Pairs Problem |
114
Voted
ICML
2004
IEEE
15 years 9 months ago
2004
IEEE
We consider the problem of eliminating redundant Boolean features for a given data set, where a feature is redundant if it separates the classes less well than another feature or ...
158
Voted
ECAI
2010
Springer
15 years 2 months ago
2010
Springer
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
127
Voted
TCS
1998
15 years 3 months ago
1998
![Threshold Dominating Sets and an Improved Characterization of W[2]](https://sciweavers.org/files/imagecache/thumbnail/imagecache/threshold_dominating_sets_and_an_improved_characterization_of_w_2_TCS_1998.jpg "Threshold Dominating Sets and an Improved Characterization of W[2]")
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...
162
Voted
CVPR
1996
IEEE
16 years 5 months ago
1996
IEEE
This paper addresses the general 3-D rigid motion problem, where the point correspondences and the motion parameters between two sets of 3-D points are to be recovered. The existe...
123
Voted
ICPR
2000
IEEE
16 years 4 months ago
2000
IEEE
Several vision tasks rely upon the availability of sets of corresponding features among images. This paper presents a method which, given some corresponding features in two stereo...