3422 search results - page 360 / 685 » Random Subset Optimization |
141
click to vote
COMPGEOM
1994
ACM
15 years 8 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
177
click to vote
ICALP
1991
Springer
15 years 8 months ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
120
click to vote
AAAI
2008
15 years 6 months ago
2008
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
140
Voted
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
148
click to vote
SMA
2010
ACM
15 years 4 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...