1568 search results - page 292 / 314 » The problem of examination questions in algorithmics |
143
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
119
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical theorems of Bourgain, and of Johnson and Lindenstrauss say that any metric on n p...
149
click to vote
BMCBI
2007
2007
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
15 years 3 months ago
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
146
click to vote
BMCBI
2004
15 years 3 months ago
2004
Background: RNA secondary structure prediction methods based on probabilistic modeling can be developed using stochastic context-free grammars (SCFGs). Such methods can readily co...
123
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...