Sciweavers

16404 search results - page 192 / 3281
» A set coverage problem
Sort
View
161
Voted
CVPR
1996
IEEE
16 years 5 months ago
Determining Correspondences and Rigid Motion of 3-D Point Sets with Missing Data
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...
Xiaoguang Wang, Yong-Qing Cheng, Robert T. Collins...
129
Voted
ACSW
2004
15 years 5 months ago
A wavelet-based neuro-fuzzy system for data mining small image sets
Creating a robust image classification system depends on having enough data with which one can adequately train and validate the model. If there is not enough available data, this...
Brendon J. Woodford, Da Deng, George L. Benwell
128
Voted
COMGEO
2008
ACM
15 years 3 months ago
Covering point sets with two disjoint disks or squares
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red ...
Sergio Cabello, José Miguel Díaz-B&a...
CAINE
2009
15 years 1 months ago
Clustering Customer Transactions: A Rough Set Based Approach
An efficient customer behavior analysis is important for good Recommender System. Customer transaction clustering is usually the first step towards the analysis of customer behavi...
Arunava Saha, Darsana Das, Dipanjan Karmakar, Dili...
CVPR
2004
IEEE
16 years 5 months ago
Approximation of Canonical Sets and Their Applications to 2D View Simplification
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...
Trip Denton, Jeff Abrahamson, Ali Shokoufandeh