Sciweavers

3679 search results - page 562 / 736
» Answer set based design of knowledge systems
Sort
View
CIKM
2005
Springer
16 years 15 days ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
ADBIS
2000
Springer
188views Database» more  ADBIS 2000»
15 years 11 months ago
Algorithms for Rewriting Aggregate Queries Using Views
Queries involving aggregation are typical in a number of database research areas, such as data warehousing, global information systems and mobile computing. One of the main ideas ...
Sara Cohen, Werner Nutt, Alexander Serebrenik
WSC
2007
15 years 9 months ago
A model for contact center analysis and simulation
In this paper we depart from a set of simple assumptions regarding the behavior of a pool of customers associated with an enterprise’s contact center. We assume that the pool of...
Juan M. Huerta
PVLDB
2010
91views more  PVLDB 2010»
15 years 5 months ago
Regret-Minimizing Representative Databases
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...
Danupon Nanongkai, Atish Das Sarma, Ashwin Lall, R...
ISMAR
2002
IEEE
15 years 12 months ago
Augmented Chemistry: An Interactive Educational Workbench
This system paper reports on some of the advantages tangible interaction can bring to chemistry education. The paper describes the realisation of an in-house designed Tangible Use...
Morten Fjeld, Benedikt M. Voegtli