Results 1  10
of
2,438
Improved Combinatorial Algorithms for the Facility Location and kMedian Problems
 In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science
, 1999
"... We present improved combinatorial approximation algorithms for the uncapacitated facility location and kmedian problems. Two central ideas in most of our results are cost scaling and greedy improvement. We present a simple greedy local search algorithm which achieves an approximation ratio of 2:414 ..."
Abstract

Cited by 225 (12 self)
 Add to MetaCart
We present improved combinatorial approximation algorithms for the uncapacitated facility location and kmedian problems. Two central ideas in most of our results are cost scaling and greedy improvement. We present a simple greedy local search algorithm which achieves an approximation ratio of 2
Wavelet Thresholding via a Bayesian Approach
 J. R. STATIST. SOC. B
, 1996
"... We discuss a Bayesian formalism which gives rise to a type of wavelet threshold estimation in nonparametric regression. A prior distribution is imposed on the wavelet coefficients of the unknown response function, designed to capture the sparseness of wavelet expansion common to most applications. ..."
Abstract

Cited by 262 (33 self)
 Add to MetaCart
. For the prior specified, the posterior median yields a thresholding procedure. Our prior model for the underlying function can be adjusted to give functions falling in any specific Besov space. We establish a relation between the hyperparameters of the prior model and the parameters of those Besov spaces within
Approximate Medians and other Quantiles in One Pass and with Limited Memory
, 1998
"... We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value distribution or the arrival distributions of the dataset. The main memory requirements are smaller than those reported ea ..."
Abstract

Cited by 124 (2 self)
 Add to MetaCart
parameter. We present the algorithms, their theoretical analysis and simulation results. 1 Introduction This article studies the problem of computing order statistics of large sequences of online or diskresident data using as little main memory as possible. We focus on computing quantiles, which
Interactive Privacy via the Median Mechanism
 In The 42nd ACM Symposium on the Theory of Computing
, 2010
"... We define a new interactive differentially private mechanism — the median mechanism — for answering arbitrary predicate queries that arrive online. Given fixed accuracy and privacy constraints, this mechanism can answer exponentially more queries than the previously best known interactive privacy me ..."
Abstract

Cited by 72 (15 self)
 Add to MetaCart
mechanism (the Laplace mechanism, which independently perturbs each query result). With respect to the number of queries, our guarantee is close to the best possible, even for noninteractive privacy mechanisms. Conceptually, the median mechanism is the first privacy mechanism capable of identifying
Secrets of Optical Flow Estimation and Their Principles
, 2010
"... The accuracy of optical flow estimation algorithms has been improving steadily as evidenced by results on the Middlebury optical flow benchmark. The typical formulation, however, has changed little since the work of Horn and Schunck. We attempt to uncover what has made recent advances possible throu ..."
Abstract

Cited by 195 (10 self)
 Add to MetaCart
The accuracy of optical flow estimation algorithms has been improving steadily as evidenced by results on the Middlebury optical flow benchmark. The typical formulation, however, has changed little since the work of Horn and Schunck. We attempt to uncover what has made recent advances possible
Triangles with three rational medians
, 2002
"... We present a characterization of all rational sided triangles with three rational medians. It turns out that they each correspond to a point on a oneparameter family of elliptic curves. It is possible to show that the rank of this family is at least two and in fact some reasonably high rank curves ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a characterization of all rational sided triangles with three rational medians. It turns out that they each correspond to a point on a oneparameter family of elliptic curves. It is possible to show that the rank of this family is at least two and in fact some reasonably high rank curves
On Lower Bounds for Selecting the Median
, 1999
"... We present a reformulation of the 2n+o(n) lower bound of Bent and John for the number of comparisons needed for selecting the median of n elements. Our reformulation uses a weight function. Apart from giving a more intuitive proof for the lower bound, the new formulation opens up possibilities fo ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We present a reformulation of the 2n+o(n) lower bound of Bent and John for the number of comparisons needed for selecting the median of n elements. Our reformulation uses a weight function. Apart from giving a more intuitive proof for the lower bound, the new formulation opens up possibilities
Association between Access Management and Traffic Safety: Median Classification and Spatial Effect
"... This study is concerned with access management analysis related to unsignalized intersections/access points. Six possible median types that could exist in the vicinity of unsignalized intersections were identified. The analysis included differentiating between medianrelated crashes and intersection ..."
Abstract
 Add to MetaCart
This study is concerned with access management analysis related to unsignalized intersections/access points. Six possible median types that could exist in the vicinity of unsignalized intersections were identified. The analysis included differentiating between medianrelated crashes
Triangles With Three Rational Medians
, 2002
"... We present a characterization of all rational sided triangles with three rational medians. It turns out that they each correspond to a point on a oneparameter family of elliptic curves. It is possible to show that the rank of this family is at least two and in fact some reasonably high rank curves ..."
Abstract
 Add to MetaCart
We present a characterization of all rational sided triangles with three rational medians. It turns out that they each correspond to a point on a oneparameter family of elliptic curves. It is possible to show that the rank of this family is at least two and in fact some reasonably high rank curves
On Reversal and Transposition Medians
"... Abstract—During the last years, the genomes of more and more species have been sequenced, providing data for phylogenetic reconstruction based on genome rearrangement measures. A main task in all phylogenetic reconstruction algorithms is to solve the median of three problem. Although this problem is ..."
Abstract
 Add to MetaCart
. Although there is no exact polynomial algorithm known even for the pairwise distances, we will show that it is in most cases possible to solve these problems exactly within reasonable time by using a branch and bound algorithm. Keywords—Comparative genomics, genome rearrangements, median, reversals
Results 1  10
of
2,438