Sciweavers

1137 search results - page 103 / 228
» Parametric Process Model Inference
Sort
View
ICASSP
2010
IEEE
13 years 9 months ago
Power law discounting for n-gram language models
We present an approximation to the Bayesian hierarchical PitmanYor process language model which maintains the power law distribution over word tokens, while not requiring a comput...
Songfang Huang, Steve Renals
BMCBI
2006
169views more  BMCBI 2006»
13 years 9 months ago
Comparative analysis of haplotype association mapping algorithms
Background: Finding the genetic causes of quantitative traits is a complex and difficult task. Classical methods for mapping quantitative trail loci (QTL) in miceuse an F2 cross b...
Phillip McClurg, Mathew T. Pletcher, Tim Wiltshire...
SEMWEB
2010
Springer
13 years 6 months ago
Fusion - Visually Exploring and Eliciting Relationships in Linked Data
Building applications over Linked Data often requires a mapping between the application model and the ontology underlying the source dataset in the Linked Data cloud. This mapping ...
Samur Araújo, Geert-Jan Houben, Daniel Schw...
JASIS
2000
120views more  JASIS 2000»
13 years 8 months ago
Probabilistic datalog: Implementing logical information retrieval for advanced applications
In the logical approach to information retrieval (IR), retrieval is considered as uncertain inference. Whereas classical IR models are based on propositional logic, we combine Dat...
Norbert Fuhr
SIGMETRICS
2008
ACM
101views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
How to parameterize models with bursty workloads
Although recent advances in theory indicate that burstiness in the service time process can be handled effectively by queueing models (e.g., MAP queueing networks [2]), there is a...
Giuliano Casale, Ningfang Mi, Ludmila Cherkasova, ...