3946 search results - page 254 / 790 » The computational complexity of choice sets |
184
click to vote
MST
2010
15 years 1 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
165
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
178
click to vote
SIGECOM
2005
ACM
16 years 8 days ago
2005
ACM
In a previously reported user study, we found that users were able to perform decision tradeoff tasks more efficiently and commit considerably fewer errors with the example critiq...
158
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: This article provides guidelines for selecting optimal numerical solvers for biomolecular system models. Because various parameters of the same system could have drast...
152
click to vote
CCS
2009
ACM
16 years 1 months ago
2009
ACM
We introduce HAIL (High-Availability and Integrity Layer), a distributed cryptographic system that allows a set of servers to prove to a client that a stored file is intact and r...