Sciweavers

417 search results - page 59 / 84
» Running Time Predictions for Factoring Algorithms
Sort
View
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
15 years 1 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
ATAL
2010
Springer
14 years 6 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...
KDD
2006
ACM
142views Data Mining» more  KDD 2006»
16 years 7 days ago
Mining distance-based outliers from large databases in any metric space
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
Yufei Tao, Xiaokui Xiao, Shuigeng Zhou
3DPVT
2006
IEEE
199views Visualization» more  3DPVT 2006»
15 years 6 months ago
Fast Level Set Multi-View Stereo on Graphics Hardware
In this paper, we show the importance and feasibility of much faster multi-view stereo reconstruction algorithms relying almost exclusively on graphics hardware. Reconstruction al...
Patrick Labatut, Renaud Keriven, Jean-Philippe Pon...
FAST
2010
15 years 2 months ago
Write Endurance in Flash Drives: Measurements and Analysis
We examine the write endurance of USB flash drives using a range of approaches: chip-level measurements, reverse engineering, timing analysis, whole-device endurance testing, and ...
Simona Boboila, Peter Desnoyers