6142 search results - page 689 / 1229 » The Complexity of Partition Functions |
209
click to vote
BMCBI
2006
15 years 7 months ago
2006
Background: Recent progresses in high-throughput proteomics have provided us with a first chance to characterize protein interaction networks (PINs), but also raised new challenge...
187
click to vote
JOC
2008
15 years 7 months ago
2008
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
228
click to vote
PAMI
2008
15 years 7 months ago
2008
In previous optimization-based methods of 3D planar-faced object reconstruction from single 2D line drawings, the missing depths of the vertices of a line drawing (and other parame...
227
click to vote
BMCBI
2004
15 years 7 months ago
2004
Background: Microarray and other high-throughput technologies are producing large sets of interesting genes that are difficult to analyze directly. Bioinformatics tools are needed...
243
click to vote
TJS
2002
15 years 6 months ago
2002
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...