Sciweavers

2777 search results - page 278 / 556
» Example centric programming
Sort
View
109
Voted
CIB
2005
41views more  CIB 2005»
15 years 3 months ago
A Partial-Repeatability Approach to Data Mining
Unlike the data approached in traditional data mining activities, software data are featured with partial-repeatability or parepeatics, which is an invariant property that can neit...
Kai-Yuan Cai, Yunfei Yin, Shichao Zhang
139
Voted
AI
1999
Springer
15 years 3 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
139
Voted
AI
1999
Springer
15 years 3 months ago
Modal Logics, Description Logics and Arithmetic Reasoning
Forthcoming in the Journal of Aritificial Intelligence We introduce mathematical programming and atomic decomposition as the basic modal (T-Box) inference techniques for a large c...
Hans Jürgen Ohlbach, Jana Koehler
127
Voted
VLSISP
1998
140views more  VLSISP 1998»
15 years 3 months ago
Audio Feature Extraction and Analysis for Scene Segmentation and Classification
Understanding of the scene content of a video sequence is very important for content-based indexing and retrieval of multimedia databases. Research in this area in the past severa...
Zhu Liu, Yao Wang, Tsuhan Chen
129
Voted
JFP
2008
97views more  JFP 2008»
15 years 2 months ago
HM(X) type inference is CLP(X) solving
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
Martin Sulzmann, Peter J. Stuckey