Sciweavers

1647 search results - page 240 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
GECCO
2005
Springer
175views Optimization» more  GECCO 2005»
14 years 3 months ago
Nonlinear feature extraction using a neuro genetic hybrid
Feature extraction is a process that extracts salient features from observed variables. It is considered a promising alternative to overcome the problems of weight and structure o...
Yung-Keun Kwon, Byung Ro Moon
CORR
2011
Springer
176views Education» more  CORR 2011»
13 years 5 months ago
Decoding by Embedding: Correct Decoding Radius and DMT Optimality
—In lattice-coded multiple-input multiple-output (MIMO) systems, optimal decoding amounts to solving the closest vector problem (CVP). Embedding is a powerful technique for the a...
Cong Ling, Shuiyin Liu, Laura Luzzi, Damien Stehl&...
SODA
2010
ACM
177views Algorithms» more  SODA 2010»
14 years 7 months ago
On the Exact Space Complexity of Sketching and Streaming Small Norms
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
ECCC
2006
88views more  ECCC 2006»
13 years 10 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna
CORR
2011
Springer
161views Education» more  CORR 2011»
13 years 4 months ago
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...
Howard J. Karloff, Flip Korn, Konstantin Makaryche...