Sciweavers

5122 search results - page 328 / 1025
» Comparing Consequence Relations
Sort
View
KDD
1998
ACM
148views Data Mining» more  KDD 1998»
15 years 11 months ago
Group Bitmap Index: A Structure for Association Rules Retrieval
Discovery of association rules from large databases of item sets is an important data mining problem. Association rules are usually stored in relational databases for future use i...
Tadeusz Morzy, Maciej Zakrzewicz
LICS
1994
IEEE
15 years 10 months ago
Subtyping and Parametricity
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
Gordon D. Plotkin, Martín Abadi, Luca Carde...
CICLING
2006
Springer
15 years 10 months ago
Verb Sense Disambiguation Using Support Vector Machines: Impact of WordNet-Extracted Features
The disambiguation of verbs is usually considered to be more difficult with respect to other part-of-speech categories. This is due both to the high polysemy of verbs compared with...
Davide Buscaldi, Paolo Rosso, Ferran Pla, Encarna ...
EDBTW
2006
Springer
15 years 10 months ago
Models for Incomplete and Probabilistic Information
Abstract. We discuss, compare and relate some old and some new models for incomplete and probabilistic databases. We characterize the expressive power of c-tables over infinite dom...
Todd J. Green, Val Tannen
EUROPAR
1995
Springer
15 years 10 months ago
Bounds on Memory Bandwidth in Streamed Computations
The growing disparity between processor and memory speeds has caused memory bandwidth to become the performance bottleneck for many applications. In particular, this performance ga...
Sally A. McKee, William A. Wulf, Trevor C. Landon