1647 search results - page 240 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
106
Voted
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
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...
134
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
—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...
SODA
2010
ACM
15 years 11 months ago
2010
ACM
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...
114
click to vote
ECCC
2006
15 years 2 months ago
2006
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...
125
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
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...