Sciweavers

63 search results - page 5 / 13
» Boolean Functions for Finite-Tree Dependencies
Sort
View
DAC
1994
ACM
13 years 11 months ago
Incorporating Speculative Execution in Exact Control-Dependent Scheduling
- This paper describes a symbolic formulation that allows incorporation of speculative operation execution (preexecution) in an exact control-dependent scheduling of arbitrary forw...
Ivan P. Radivojevic, Forrest Brewer
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 7 months ago
On the fourier tails of bounded functions over the discrete cube
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Don...
BMCBI
2007
164views more  BMCBI 2007»
13 years 7 months ago
Comparison of probabilistic Boolean network and dynamic Bayesian network approaches for inferring gene regulatory networks
Background: The regulation of gene expression is achieved through gene regulatory networks (GRNs) in which collections of genes interact with one another and other substances in a...
Peng Li, Chaoyang Zhang, Edward J. Perkins, Ping G...
SAS
2004
Springer
140views Formal Methods» more  SAS 2004»
14 years 24 days ago
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
Sumit Gulwani, George C. Necula
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 7 months ago
Nonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
Ashley Montanaro