Sciweavers

1082 search results - page 16 / 217
» Approximation Algorithms for Spreading Points
Sort
View
ICDT
2011
ACM
232views Database» more  ICDT 2011»
12 years 11 months ago
(Approximate) uncertain skylines
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasp...
MP
1998
73views more  MP 1998»
13 years 7 months ago
On proving existence of feasible points in equality constrained optimization problems
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
R. Baker Kearfott
ESA
2011
Springer
252views Algorithms» more  ESA 2011»
12 years 7 months ago
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane
Over the past several decades, many combinatorial measures have been devised for capturing the statistical data depth of a set of n points in R2 . These include Tukey depth [15], O...
Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
ISBI
2008
IEEE
14 years 8 months ago
Improving single particle localization with an empirically calibrated Gaussian kernel
Accurate computational localization of single fluorescent particles is of interest to many biophysical studies and underlies recent approaches to high resolution microscopy using ...
Marcio de Moraes Marim, Bo Zhang, Jean-Christophe ...
ECCV
2008
Springer
14 years 9 months ago
Solving Image Registration Problems Using Interior Point Methods
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
Camillo J. Taylor, Arvind Bhusnurmath