Sciweavers

1100 search results - page 124 / 220
» Approximate distance oracles
Sort
View
ICALP
2009
Springer
15 years 10 months ago
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
Sudipto Guha, Zhiyi Huang
ICB
2009
Springer
119views Biometrics» more  ICB 2009»
15 years 4 months ago
Multi-Region Probabilistic Histograms for Robust and Scalable Identity Inference
We propose a scalable face matching algorithm capable of dealing with faces subject to several concurrent and uncontrolled factors, such as variations in pose, expression, illumina...
Conrad Sanderson, Brian C. Lovell
SASO
2008
IEEE
15 years 4 months ago
Empirical Characterization of Discretization Error in Gradient-Based Algorithms
Many self-organizing and self-adaptive systems use the biologically inspired “gradient” primitive, in which each device in a network estimates its distance to the closest devi...
Jonathan Bachrach, Jacob Beal, Joshua Horowitz, Da...
ICC
2007
IEEE
15 years 4 months ago
Linear Precoding with Minimum BER Criterion for MIMO-OFDM Systems Employing ML Detection
Abstract— This paper proposes a new MIMO-OFDM precoding method that minimizes BER of the maximum likelihood detection (MLD). Conventional MIMO precoding methods can approximately...
Boonsarn Pitakdumrongkija, Kazuhiko Fukawa, Hirosh...
ICALP
2007
Springer
15 years 4 months ago
Low Distortion Spanners
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
Seth Pettie