Sciweavers

222 search results - page 26 / 45
» Design and Implementation of Semi-preemptible IO
Sort
View
ENC
2004
IEEE
14 years 1 months ago
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
Christophe Cérin, Gay Gay, Gaël Le Mah...
VLDB
2000
ACM
136views Database» more  VLDB 2000»
14 years 1 months ago
Managing Intervals Efficiently in Object-Relational Databases
Modern database applications show a growing demand for efficient and dynamic management of intervals, particularly for temporal and spatial data or for constraint handling. Common...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
CORR
2008
Springer
147views Education» more  CORR 2008»
13 years 10 months ago
A Minimum Relative Entropy Principle for Learning and Acting
This paper proposes a method to construct an adaptive agent that is universal with respect to a given class of experts, where each expert is designed specifically for a particular...
Pedro A. Ortega, Daniel A. Braun
HPCA
2006
IEEE
14 years 10 months ago
The common case transactional behavior of multithreaded programs
Transactional memory (TM) provides an easy-to-use and high-performance parallel programming model for the upcoming chip-multiprocessor systems. Several researchers have proposed a...
JaeWoong Chung, Hassan Chafi, Chi Cao Minh, Austen...
SIGSOFT
2008
ACM
14 years 10 months ago
Towards compositional synthesis of evolving systems
Synthesis of system configurations from a given set of features is an important and very challenging problem. This paper makes a step towards this goal by describing an efficient ...
Shiva Nejati, Mehrdad Sabetzadeh, Marsha Chechik, ...