Sciweavers

1980 search results - page 155 / 396
» On the Associative Nijenhuis Relation
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 6 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
15 years 5 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
CLOUDCOM
2009
Springer
15 years 5 months ago
Cost-Minimizing Scheduling of Workflows on a Cloud of Memory Managed Multicore Machines
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...
Nicolas G. Grounds, John K. Antonio, Jeffrey T. Mu...
CIKM
2006
Springer
15 years 5 months ago
Matching directories and OWL ontologies with AROMA
This paper presents a simple and adaptable matching method dealing with web directories, catalogs and OWL ontologies. By using a well-known Knowledge Discovery in Databases model,...
Jérôme David, Fabrice Guillet, Henri ...
VLDB
1991
ACM
110views Database» more  VLDB 1991»
15 years 5 months ago
Ode as an Active Database: Constraints and Triggers
The Ode object-oriented database provides facilities for associating conslraims and [riggers with ohjecls. Conslrainls and triggers are associated with class (ohjea type) definiti...
Narain H. Gehani, H. V. Jagadish