Sciweavers

648 search results - page 31 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
122
Voted
COLT
2005
Springer
15 years 6 months ago
Leaving the Span
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...
Manfred K. Warmuth, S. V. N. Vishwanathan
103
Voted
NIPS
2007
15 years 1 months ago
Bayesian Inference for Spiking Neuron Models with a Sparsity Prior
Generalized linear models are the most commonly used tools to describe the stimulus selectivity of sensory neurons. Here we present a Bayesian treatment of such models. Using the ...
Sebastian Gerwinn, Jakob Macke, Matthias Seeger, M...
132
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Weighted and structured sparse total least-squares for perturbed compressive sampling
Solving linear regression problems based on the total least-squares (TLS) criterion has well-documented merits in various applications, where perturbations appear both in the data...
Hao Zhu, Georgios B. Giannakis, Geert Leus
87
Voted
ICALP
2009
Springer
16 years 24 days ago
Towards Optimal Range Medians
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
Beat Gfeller, Peter Sanders
100
Voted
WABI
2005
Springer
132views Bioinformatics» more  WABI 2005»
15 years 6 months ago
Perfect Sorting by Reversals Is Not Always Difficult
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
Sèverine Bérard, Anne Bergeron, Cedr...