2957 search results - page 250 / 592 » The Complexity of Polynomial-Time Approximation |
156
Voted
CSDA
2008
15 years 6 months ago
2008
Sociologists, demographers, and economists often use the index of dissimilarity, D, to describe the extent of racial, ethnic, spatial, or areal dissimilarity (or segregation) of d...
183
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
170
click to vote
ALT
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
175
click to vote
HYBRID
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...
178
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Predictive state representations (PSRs) are models that represent the state of a dynamical system as a set of predictions about future events. The existing work with PSRs focuses ...