Sciweavers

129 search results - page 14 / 26
» Compiling Possibilistic Knowledge Bases
Sort
View
JSAT
2006
126views more  JSAT 2006»
13 years 7 months ago
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...
DELTA
2010
IEEE
14 years 17 days ago
Algorithm Transformation for FPGA Implementation
— High level hardware description languages aim to make hardware design more like programming software. These languages are often used to accelerate legacy software algorithms by ...
Donald G. Bailey, Christopher T. Johnston
BMCBI
2007
151views more  BMCBI 2007»
13 years 7 months ago
A statistical method to incorporate biological knowledge for generating testable novel gene regulatory interactions from microar
Background: The incorporation of prior biological knowledge in the analysis of microarray data has become important in the reconstruction of transcription regulatory networks in a...
Peter Larsen, Eyad Almasri, Guanrao Chen, Yang Dai
NLPRS
2001
Springer
13 years 12 months ago
Automatic Corpus-Based Extraction of Chinese Legal Terms
This paper reports on a study involving the automatic extraction of Chinese legal terms. We used a word segmented corpus of Chinese court judgments to extract salient legal expres...
Oi Yee Kwong, Benjamin K. Tsou
SAS
2000
Springer
124views Formal Methods» more  SAS 2000»
13 years 11 months ago
Code Specialization Based on Value Profiles
Abstract. It is often the case at runtime that variables and registers in programs are "quasi-invariant," i.e., the distribution of the values they take on is very skewed...
Robert Muth, Scott A. Watterson, Saumya K. Debray