2925 search results - page 482 / 585 » Information Complexity of Online Problems |
142
click to vote
ASPLOS
2008
ACM
15 years 5 months ago
2008
ACM
It is not uncommon for modern systems to be composed of a variety of interacting services, running across multiple machines in such a way that most developers do not really unders...
143
Voted
TMI
2008
15 years 3 months ago
2008
Abstract--Due to the significant complexity of membrane morphology and the generally poor image quality in electron tomographic volumes, current automatic methods for segmentation ...
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...
157
Voted
IWCIA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
137
click to vote
SIGECOM
2010
ACM
15 years 8 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...