Sciweavers

2135 search results - page 197 / 427
» Database Paper - The IRI Marketing Data Set
Sort
View
CORR
2011
Springer
185views Education» more  CORR 2011»
15 years 1 months ago
Sound and Complete Query Answering in Intensional P2P Data Integration
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
Zoran Majkic
CINQ
2004
Springer
125views Database» more  CINQ 2004»
15 years 11 months ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders
WWW
2010
ACM
15 years 11 months ago
Keyword search over key-value stores
Key-value stores (KVSs) are the most prevalent storage systems for large scale web services. As they do not have the structural complexities of RDBMSs, they are more efficient. In...
Arash Termehchy, Marianne Winslett
CRV
2008
IEEE
142views Robotics» more  CRV 2008»
15 years 8 months ago
Invariant Classification of Gait Types
This paper presents a method of classifying human gait in an invariant manner based on silhouette comparison. A database of artificially generated silhouettes is created represent...
Preben Fihl, Thomas B. Moeslund
IAJIT
2008
94views more  IAJIT 2008»
15 years 6 months ago
Enforcing User-Defined Constraints during the Run-Time in OODB
: In this paper a run-time model is proposed. The run-time model enforces integrity constraints for attributes that are derived from composition and inheritance hierarchies. The ru...
Belal Zaqaibeh, Hamidah Ibrahim, Ali Mamat, Md Nas...