1403 search results - page 69 / 281 » Set cover algorithms for very large datasets |
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
We consider feature selection in the semi-supervised learning setting. This problem is rarely addressed in the literature. We propose a new algorithm as a natural extension of the...
IMR
2004
Springer
15 years 3 months ago
2004
Springer
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
SIGGRAPH
2000
ACM
15 years 2 months ago
2000
ACM
We describe a hardware and software system for digitizing the shape and color of large fragile objects under non-laboratory conditions. Our system employs laser triangulation rang...
110
click to vote
CHI
2011
ACM
14 years 1 months ago
2011
ACM
Extracting useful knowledge from large network datasets has become a fundamental challenge in many domains, from scientific literature to social networks and the web. We introduc...
101
click to vote
EDBT
2012
ACM
13 years 5 days ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...