Sciweavers

3415 search results - page 168 / 683
» Lower Bounds for Kernelizations
Sort
View
96
Voted
TIT
2008
84views more  TIT 2008»
15 years 4 months ago
Capacity Bounds for Sticky Channels
The capacity of sticky channels, a subclass of insertion channels where each symbol may be duplicated multiple times, is considered. The primary result is to provide nearly tight n...
Michael Mitzenmacher
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
15 years 4 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
142
Voted
NIPS
2008
15 years 6 months ago
Diffeomorphic Dimensionality Reduction
This paper introduces a new approach to constructing meaningful lower dimensional representations of sets of data points. We argue that constraining the mapping between the high a...
Christian Walder, Bernhard Schölkopf
CORR
2010
Springer
76views Education» more  CORR 2010»
15 years 4 months ago
Improved Bounds on Restricted Isometry Constants for Gaussian Matrices
The Restricted Isometry Constants (RIC) of a matrix A measures how close to an isometry is the action of A on vectors with few nonzero entries, measured in the 2 norm. Specifically...
Bubacarr Bah, Jared Tanner
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
16 years 2 months ago
Optimally Reconstructing Weighted Graphs Using Queries
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
Hanna Mazzawi