Sciweavers

186 search results - page 26 / 38
» Processing Sequential Patterns in Relational Databases
Sort
View
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 1 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
OSN
2011
12 years 10 months ago
A parallel iterative scheduler for asynchronous Optical Packet Switching networks
—This paper presents PI-OPS (Parallel-Iterative Optical Packet Scheduler) a parallel-iterative scheduler for asynchronous Optical Packet Switching nodes with optical buffering. O...
Pablo Pavón-Mariño, M. Victoria Buen...
DAWAK
2000
Springer
14 years 4 hour ago
Mining Frequent Binary Expressions
In data mining, searching for frequent patterns is a common basic operation. It forms the basis of many interesting decision support processes. In this paper we present a new type ...
Toon Calders, Jan Paredaens
IJISTA
2008
95views more  IJISTA 2008»
13 years 7 months ago
Mining manufacturing data using genetic algorithm-based feature set decomposition
Data mining methods can be used for discovering interesting patterns in manufacturing databases. These patterns can be used to improve manufacturing processes. However, data accum...
Lior Rokach
ISMIS
2003
Springer
14 years 25 days ago
Development of Generic Search Method Based on Transformation Invariance
Abstract. The needs of efficient and flexible information retrieval on multistructural data stored in database and network are significantly growing. Especially, its flexibility pl...
Fuminori Adachi, Takashi Washio, Hiroshi Motoda, A...