Sciweavers

1173 search results - page 170 / 235
» Ranking functions and rankings on languages
Sort
View
SAC
2009
ACM
14 years 2 months ago
Exploiting weak dependencies in tree-based search
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
Alejandro Arbelaez, Youssef Hamadi
FOCI
2007
IEEE
14 years 2 months ago
Almost All Learning Machines are Singular
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
Sumio Watanabe
ICDM
2003
IEEE
92views Data Mining» more  ICDM 2003»
14 years 28 days ago
Postprocessing Decision Trees to Extract Actionable Knowledge
Most data mining algorithms and tools stop at discovered customer models, producing distribution information on customer profiles. Such techniques, when applied to industrial pro...
Qiang Yang, Jie Yin, Charles X. Ling, Tielin Chen
CSFW
2010
IEEE
13 years 11 months ago
Towards Quantitative Analysis of Proofs of Authorization: Applications, Framework, and Techniques
—Although policy compliance testing is generally treated as a binary decision problem, the evidence gathered during the trust management process can actually be used to examine t...
Adam J. Lee, Ting Yu
CAGD
2005
116views more  CAGD 2005»
13 years 7 months ago
A sharpness dependent filter for mesh smoothing
In this paper, we propose a sharpness dependent filter design based on the fairing of surface normal, whereby the filtering algorithm automatically selects a filter. This may be a...
Chun-Yen Chen, Kuo-Young Cheng