Sciweavers

331 search results - page 27 / 67
» New Results on the Pseudorandomness of Some Blockcipher Cons...
Sort
View
UAI
2003
15 years 7 months ago
Large-Sample Learning of Bayesian Networks is NP-Hard
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
David Maxwell Chickering, Christopher Meek, David ...
AUTOMATICA
2010
96views more  AUTOMATICA 2010»
15 years 6 months ago
On resampling and uncertainty estimation in Linear System Identification
Linear System Identification yields a nominal model parameter, which minimizes a specific criterion based on the single inputoutput data set. Here we investigate the utility of va...
Simone Garatti, Robert R. Bitmead
BMCBI
2010
161views more  BMCBI 2010»
15 years 3 months ago
LTC: a novel algorithm to improve the efficiency of contig assembly for physical mapping in complex genomes
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...
Zeev Frenkel, Etienne Paux, David I. Mester, Cathe...
EMNLP
2007
15 years 7 months ago
Extending a Thesaurus in the Pan-Chinese Context
In this paper, we address a unique problem in Chinese language processing and report on our study on extending a Chinese thesaurus with region-specific words, mostly from the fina...
Oi Yee Kwong, Benjamin Ka-Yin T'sou
TAP
2008
Springer
102views Hardware» more  TAP 2008»
15 years 6 months ago
A Logic-Based Approach to Combinatorial Testing with Constraints
Abstract. Usage of combinatorial testing is wide spreading as an effective technique to reveal unintended feature interaction inside a given system. To this aim, test cases are con...
Andrea Calvagna, Angelo Gargantini