Sciweavers

1146 search results - page 173 / 230
» Semantics of Data Streams and Operators
Sort
View
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
15 years 8 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
ICC
2007
IEEE
162views Communications» more  ICC 2007»
15 years 10 months ago
Ontology-Based Reasoning for Supporting Context-Aware Services on Autonomic Networks
- Ontology engineering has been proposed as a formal mechanism for both reducing the complexity of managing the information needed in network management and autonomic systems and f...
Jaime Martín Serrano, Joan Serrat, John Str...
POPL
2007
ACM
16 years 4 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
FCCM
2004
IEEE
130views VLSI» more  FCCM 2004»
15 years 8 months ago
Hyperreconfigurable Architectures for Fast Run Time Reconfiguration
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit changing needs of a computation during run time. The increasing...
Sebastian Lange, Martin Middendorf
VLDB
1992
ACM
101views Database» more  VLDB 1992»
15 years 8 months ago
Proclamation-Based Model for Cooperating Transactions
We propose a transaction model that provides a framework for transactions to cooperate without sacrificing serializability as a notion of correctness. Cooperation does not depend ...
H. V. Jagadish, Oded Shmueli