Sciweavers

564 search results - page 80 / 113
» Some Results on the Expressive Power and Complexity of LSCs
Sort
View
BMCBI
2007
157views more  BMCBI 2007»
14 years 9 months ago
Constructing gene co-expression networks and predicting functions of unknown genes by random matrix theory
Background: Large-scale sequencing of entire genomes has ushered in a new age in biology. One of the next grand challenges is to dissect the cellular networks consisting of many i...
Feng Luo, Yunfeng Yang, Jianxin Zhong, Haichun Gao...
POPL
2006
ACM
15 years 10 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao
CORR
2006
Springer
119views Education» more  CORR 2006»
14 years 9 months ago
Broadcast Cooperation Strategies for Two Colocated Users
This work considers the problem of communication from a single transmitter, over a network with colocated users, through an independent block Rayleigh fading channel. The colocati...
Avi Steiner, Amichai Sanderovich, Shlomo Shamai
FUIN
2007
135views more  FUIN 2007»
14 years 9 months ago
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
Volker Diekert, Martin Horsch, Manfred Kufleitner
FSTTCS
1992
Springer
15 years 1 months ago
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
Vikraman Arvind, Johannes Köbler, Martin Mund...