4860 search results - page 340 / 972 » SNPs Problems, Complexity, and Algorithms |
131
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
140
click to vote
ESA
2005
Springer
15 years 9 months ago
2005
Springer
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
132
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
116
click to vote
CCR
2004
15 years 3 months ago
2004
Scheduling algorithms for input-queued packet switches have been widely researched. It has been shown that various classes of scheduling algorithms provide guarantees on stability ...
133
click to vote
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...