Sciweavers

287 search results - page 41 / 58
» Optimization Techniques for Queries with Expensive Methods
Sort
View
ICDE
2002
IEEE
102views Database» more  ICDE 2002»
14 years 8 months ago
Cost Models for Overlapping and Multi-Version B-Trees
Overlapping and multi-version techniques are two popular frameworks that transform an ephemeral index into a multiple logical-tree structure in order to support versioning databas...
Yufei Tao, Dimitris Papadias, Jun Zhang
HPDC
2008
IEEE
14 years 1 months ago
Ontological framework for a free-form query based grid search engine
If the model of free-form queries, which has proved successful for HTML based search on the Web, is made available for Grid services, it will serve as a powerful tool for scientis...
Chaitali Gupta, Rajdeep Bhowmik, Madhusudhan Govin...
EUROPAR
2007
Springer
14 years 1 months ago
Compositional Approach Applied to Loop Specialization
An optimizing compiler has a hard time to generate a code which will perform at top speed for an arbitrary data set size. In general, the low level optimization process must take i...
Lamia Djoudi, Jean-Thomas Acquaviva, Denis Barthou
ICDE
2007
IEEE
117views Database» more  ICDE 2007»
14 years 8 months ago
Cost-Conscious Cleaning of Massive RFID Data Sets
Efficient and accurate data cleaning is an essential task for the successful deployment of RFID systems. Although important advances have been made in tag detection rates, it is s...
Hector Gonzalez, Jiawei Han, Xuehua Shen
ICML
2002
IEEE
14 years 8 months ago
Action Refinement in Reinforcement Learning by Probability Smoothing
In many reinforcement learning applications, the set of possible actions can be partitioned by the programmer into subsets of similar actions. This paper presents a technique for ...
Carles Sierra, Dídac Busquets, Ramon L&oacu...