1403 search results - page 205 / 281 » Set cover algorithms for very large datasets |
107
click to vote
3DPVT
2006
IEEE
15 years 3 months ago
2006
IEEE
Interactive network-based navigation over large urban environments raises difficult problems due to the size and complexity of these scenes. In this paper, we present a clientser...
VISUALIZATION
2002
IEEE
15 years 2 months ago
2002
IEEE
We present a method for interactive rendering of large outdoor scenes. Complex polygonal plant models and whole plant populations are represented by relatively small sets of point...
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper we consider the problem of outlier removal for large scale multiview reconstruction problems. An efficient and very popular method for this task is RANSAC. However, a...
VLDB
1998
ACM
15 years 2 months ago
1998
ACM
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
KDD
2001
ACM
15 years 10 months ago
2001
ACM
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...