1007 search results - page 69 / 202 » The Complexity of Futile Questioning |
140
click to vote
ASPLOS
2011
ACM
14 years 7 months ago
2011
ACM
The power-efficient massively parallel Graphics Processing Units (GPUs) have become increasingly influential for scientific computing over the past few years. However, their ef...
158
click to vote
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
100
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: It has been previously shown that palindromic sequences are frequently observed in proteins. However, our knowledge about their evolutionary origin and their possible ...
117
click to vote
PODC
2009
ACM
16 years 4 months ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
124
click to vote
CC
2007
Springer
15 years 3 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...