Sciweavers

11384 search results - page 409 / 2277
» Achieved IPC Performance
Sort
View
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
13 years 6 months ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
13 years 6 months ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
CVPR
2012
IEEE
13 years 6 months ago
Seeded watershed cut uncertainty estimators for guided interactive segmentation
Watershed cuts are among the fastest segmentation algorithms and therefore well suited for interactive segmentation of very large 3D data sets. To minimize the number of user inte...
Christoph N. Straehle, Ullrich Köthe, Graham ...
CVPR
2012
IEEE
13 years 6 months ago
3D visual phrases for landmark recognition
In this paper, we study the problem of landmark recognition and propose to leverage 3D visual phrases to improve the performance. A 3D visual phrase is a triangular facet on the s...
Qiang Hao, Rui Cai, Zhiwei Li, Lei Zhang 0001, Yan...
CVPR
2012
IEEE
13 years 6 months ago
Cross-based local multipoint filtering
This paper presents a cross-based framework of performing local multipoint filtering efficiently. We formulate the filtering process as a local multipoint regression problem, c...
Jiangbo Lu, Keyang Shi, Dongbo Min, Liang Lin, Min...