Sciweavers

2117 search results - page 171 / 424
» Data Modelling in Complex Application Domains
Sort
View
JSW
2008
99views more  JSW 2008»
15 years 4 months ago
Using Data Mining in MURA Graphic Problems
The MURA phenomenon will result lots of problems in Photomask and TFT-LCD industries as well. In this paper, we designed and developed a MURA related association rules which suitab...
Wen-Hsing Kao, Jason C. Hung, Victoria Hsu
HPDC
1999
IEEE
15 years 8 months ago
Remote Application Scheduling on Metacomputing Systems
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
Heath A. James, Kenneth A. Hawick
136
Voted
JMLR
2010
104views more  JMLR 2010»
14 years 10 months ago
Increasing Feature Selection Accuracy for L1 Regularized Linear Models
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...
Abhishek Jaiantilal, Gregory Z. Grudic
SIGMOD
2010
ACM
149views Database» more  SIGMOD 2010»
14 years 10 months ago
On models and query languages for probabilistic processes
Probabilistic processes appear naturally in various contexts, with applications to Business Processes, XML data management and more. Many models for specifying and querying such p...
Daniel Deutch, Tova Milo
CSDA
2007
134views more  CSDA 2007»
15 years 4 months ago
Variational approximations in Bayesian model selection for finite mixture distributions
Variational methods for model comparison have become popular in the neural computing/machine learning literature. In this paper we explore their application to the Bayesian analys...
Clare A. McGrory, D. M. Titterington