Sciweavers

762 search results - page 134 / 153
» Conditionally correct superoptimization
Sort
View
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 11 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...
BMCBI
2008
99views more  BMCBI 2008»
13 years 10 months ago
A new real-time PCR method to overcome significant quantitative inaccuracy due to slight amplification inhibition
Background: Real-time PCR analysis is a sensitive DNA quantification technique that has recently gained considerable attention in biotechnology, microbiology and molecular diagnos...
Michele Guescini, Davide Sisti, Marco B. L. Rocchi...
DC
2010
13 years 10 months ago
Model checking transactional memories
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
JSAC
2006
96views more  JSAC 2006»
13 years 9 months ago
Price-based distributed algorithms for rate-reliability tradeoff in network utility maximization
Abstract--The current framework of network utility maximization for rate allocation and its price-based algorithms assumes that each link provides a fixed-size transmission "p...
Jang-Won Lee, Mung Chiang, A. Robert Calderbank
IPL
2007
105views more  IPL 2007»
13 years 9 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk