Sciweavers

1337 search results - page 21 / 268
» Fast computation of distance estimators
Sort
View
FPL
2008
Springer
143views Hardware» more  FPL 2008»
13 years 9 months ago
Fast toggle rate computation for FPGA circuits
This paper presents a fast and scalable method of computing signal toggle rate in FPGA-based circuits. Our technique is a vectorless estimation technique, which can be used in a C...
Tomasz S. Czajkowski, Stephen Dean Brown
CVPR
2012
IEEE
11 years 10 months ago
A fast nearest neighbor search algorithm by nonlinear embedding
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
Yoonho Hwang, Bohyung Han, Hee-Kap Ahn
RECOMB
2006
Springer
14 years 8 months ago
Maximal Accurate Forests from Distance Matrices
Abstract. We present a fast converging method for distance-based phylogenetic inference, which is novel in two respects. First, it is the only method (to our knowledge) to guarante...
Constantinos Daskalakis, Cameron Hill, Alexander J...
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 2 months ago
Fast global convergence of gradient methods for high-dimensional statistical recovery
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
SIAMCOMP
2002
113views more  SIAMCOMP 2002»
13 years 7 months ago
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
Joachim Gudmundsson, Christos Levcopoulos, Giri Na...