Sciweavers

9 search results - page 1 / 2
» Efficient Algorithms for Maximum Regression Depth
Sort
View
DCG
2008
86views more  DCG 2008»
13 years 7 months ago
Efficient Algorithms for Maximum Regression Depth
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
Marc J. van Kreveld, Joseph S. B. Mitchell, Peter ...
CSDA
2007
105views more  CSDA 2007»
13 years 7 months ago
Calculation of simplicial depth estimators for polynomial regression with applications
A fast algorithm for calculating the simplicial depth of a single parameter vector of a polynomial regression model is derived. Additionally, an algorithm for calculating the para...
R. Wellmann, S. Katina, Ch. H. Müller
ICASSP
2007
IEEE
13 years 11 months ago
Depth Detection of Light Field
We propose an algorithm to detect depths in a light field. Specifically, given a 4D light field, we find all planes at which objects are located. Although the exact depth of each ...
Yi-Hao Kao, Chia-Kai Liang, Li-Wen Chang, Homer H....
ISCAS
1994
IEEE
117views Hardware» more  ISCAS 1994»
13 years 11 months ago
Design of a Fast Sequential Decoding Algorithm Based on Dynamic Searching Strategy
This paper presents a new sequential decoding algorithm based on dynamic searching strategy to improve decoding efficiency. The searching strategy is to exploit both sorting and p...
Wen-Wei Yang, Li-Fu Jeng, Chen-Yi Lee
EOR
2010
178views more  EOR 2010»
13 years 7 months ago
Facility location problems in the plane based on reverse nearest neighbor queries
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
Sergio Cabello, José Miguel Díaz-B&a...