Sciweavers

784 search results - page 68 / 157
» Relaxing the Value Restriction
Sort
View
AIED
2005
Springer
14 years 2 months ago
Relation-based heuristic diffusion framework for LOM generation
Learning Object Metadata (LOM) intends to facilitate the retrieval and reuse of learning material. However, the fastidious task of authoring them limits their use. Motivated by thi...
Olivier Motelet
SAC
2004
ACM
14 years 2 months ago
Mining dependence rules by finding largest itemset support quota
In the paper a new data mining algorithm for finding the most interesting dependence rules is described. Dependence rules are derived from the itemsets with support significantly ...
Alexandr A. Savinov
PCM
2004
Springer
107views Multimedia» more  PCM 2004»
14 years 2 months ago
Complete Performance Graphs in Probabilistic Information Retrieval
The performance of a Content-Based Image Retrieval (CBIR) system presented in the form of Precision-Recall or PrecisionScope graphs offers an incomplete overview of the system und...
Nicu Sebe, Dionysius P. Huijsmans, Qi Tian, Theo G...
CPAIOR
2010
Springer
14 years 2 months ago
The Increasing Nvalue Constraint
This paper introduces the Increasing Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is l...
Nicolas Beldiceanu, Fabien Hermenier, Xavier Lorca...
FSTTCS
2006
Springer
14 years 25 days ago
One-Input-Face MPCVP Is Hard for L, But in LogDCFL
A monotone planar circuit (MPC) is a Boolean circuit that can be embedded in a plane, and that has only AND and OR gates. Yang showed that the one-input-face monotone planar circui...
Tanmoy Chakraborty, Samir Datta