1403 search results - page 25 / 281 » Set cover algorithms for very large datasets |
NIPS
2007
13 years 10 months ago
2007
This paper investigates the application of randomized algorithms for large scale SVM learning. The key contribution of the paper is to show that, by using ideas random projections...
ICDE
2004
IEEE
14 years 9 months ago
2004
IEEE
In this paper, we will look at substructure clustering of sequential 3d objects. A sequential 3d object is a set of points located in a three dimensional space that are linked up ...
VISUALIZATION
2002
IEEE
14 years 1 months ago
2002
IEEE
We present a new algorithm for rendering very large volume data sets at interactive framerates on standard PC hardware. The algorithm accepts scalar data sampled on a regular grid...
FOCM
2010
13 years 7 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
BMCBI
2008
13 years 8 months ago
2008
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...