Sciweavers

1943 search results - page 224 / 389
» Ordering Default Theories
Sort
View
IJAR
2010
70views more  IJAR 2010»
15 years 5 months ago
Granular computing applied to ontologies
Granular Computing is an emerging conceptual and computing paradigm of information processing. A central notion is an information-processing pyramid with different levels of clari...
Silvia Calegari, Davide Ciucci
JCT
2010
112views more  JCT 2010»
15 years 5 months ago
More on block intersection polynomials and new applications to graphs and block designs
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
Leonard H. Soicher
JUCS
2010
83views more  JUCS 2010»
15 years 5 months ago
Detecting Market Trends by Ignoring It, Some Days
Abstract: The last k days of trading together tell the financial market trends. It may be inconceivable if we are told to ignore the 3rd, 6th, and 8th day, a priori. We introduce ...
Jessie Wenhui Zou, Xiaotie Deng, Ming Li
MCS
2010
Springer
15 years 5 months ago
MinT - Architecture and applications of the (t, m, s)-net and OOA database
Many different constructions for (t, m, s)-nets and (t, s)-sequences are known today. Propagation rules as well as connections to other mathematical objects make it difficult to ...
Rudolf Schürer, Wolfgang Ch. Schmid
NECO
2010
97views more  NECO 2010»
15 years 5 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell