7150 search results - page 433 / 1430 » An Approximation Algorithm for Approximation Rank |
186
click to vote
ICCAD
1993
IEEE
15 years 11 months ago
1993
IEEE
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
214
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
308
click to vote
GIS
2006
ACM
16 years 8 months ago
2006
ACM
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
170
click to vote
ACMICEC
2007
ACM
15 years 11 months ago
2007
ACM
This paper introduces algorithms for learning how to trade using insider (superior) information in Kyle's model of financial markets. Prior results in finance theory relied o...
193
click to vote
BIBM
2009
IEEE
15 years 11 months ago
2009
IEEE
We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may conta...