Sciweavers

1686 search results - page 129 / 338
» Programs as polygraphs: computability and complexity
Sort
View
156
Voted
AB
2008
Springer
15 years 10 months ago
Algorithms for Inference, Analysis and Control of Boolean Networks
Boolean networks (BNs) are known as a mathematical model of genetic networks. In this paper, we overview algorithmic aspects of inference, analysis and control of BNs while focusin...
Tatsuya Akutsu, Morihiro Hayashida, Takeyuki Tamur...
130
Voted
ICPP
2008
IEEE
15 years 10 months ago
Parallelization and Characterization of Probabilistic Latent Semantic Analysis
Probabilistic Latent Semantic Analysis (PLSA) is one of the most popular statistical techniques for the analysis of two-model and co-occurrence data. It has applications in inform...
Chuntao Hong, Wenguang Chen, Weimin Zheng, Jiulong...
147
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
Resource allocation for heterogeneous multiuser OFDM-based cognitive radio networks with imperfect spectrum sensing
—In this paper we study the resource allocation in OFDM-based cognitive radio (CR) networks, under the consideration of many practical limitations such as imperfect spectrum sens...
Shaowei Wang, Zhi-Hua Zhou, Mengyao Ge, Chonggang ...
POPL
2010
ACM
15 years 6 months ago
Reconfigurable asynchronous logic automata: (RALA)
Computer science has served to insulate programs and programmers from knowledge of the underlying mechanisms used to manipulate information, however this fiction is increasingly h...
Neil Gershenfeld, David Dalrymple, Kailiang Chen, ...
216
Voted
PDPTA
2010
15 years 1 months ago
Data-Parallelism and GPUs for Lattice Gas Fluid Simulations
Lattice gas cellular automata (LGCA) models provide a relatively fast means of simulating fluid flow and can give both quantitative and qualitative insights into flow patterns aro...
Mitchel Johnson, Daniel P. Playne, Kenneth A. Hawi...