381 search results - page 1 / 77 » On the advantage over a random assignment |
STOC
2002
ACM
14 years 5 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + δ fraction of all...
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
Generative topic models such as LDA are limited by their inability to utilize nontrivial input features to enhance their performance, and many topic models assume that topic assig...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
— The aggregate capacity of wireless ad-hoc networks can be substantially increased if each wireless node is equipped with multiple network interface cards (NICs) and each NIC op...
WSC
2008
13 years 7 months ago
2008
Multitrajectory simulation allows explicit management of random events by allowing particular events to be resolved by random draw, by a deterministic choice, or by creating new s...