Sciweavers

287 search results - page 9 / 58
» Hypothesis Testing over Factorizations for Data Association
Sort
View
NLPRS
2001
Springer
14 years 1 months ago
A Simple Closed-Class/Open-Class Factorization for Improved Language Modeling
We describe a simple improvement to ngram language models where we estimate the distribution over closed-class (function) words separately from the conditional distribution of ope...
Fuchun Peng, Dale Schuurmans
ESA
2010
Springer
183views Algorithms» more  ESA 2010»
13 years 9 months ago
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
Sorelle A. Friedler, David M. Mount
JMLR
2010
124views more  JMLR 2010»
13 years 3 months ago
Consistent Nonparametric Tests of Independence
Three simple and explicit procedures for testing the independence of two multi-dimensional random variables are described. Two of the associated test statistics (L1, log-likelihoo...
Arthur Gretton, László Györfi
DAC
1996
ACM
14 years 23 days ago
Pseudorandom-Pattern Test Resistance in High-Performance DSP Datapaths
The testability of basic DSP datapath structures using pseudorandom built-in self-test techniques is examined. The addition of variance mismatched signals is identified as a testi...
Laurence Goodby, Alex Orailoglu
ICSE
2005
IEEE-ACM
14 years 8 months ago
Validation methods for calibrating software effort models
COCONUT calibrates effort estimation models using an exhaustive search over the space of calibration parameters in a COCOMO I model. This technique is much simpler than other effo...
Tim Menzies, Daniel Port, Zhihao Chen, Jairus Hihn...