Sciweavers

3495 search results - page 497 / 699
» On the random satisfiable process
Sort
View
CIKM
2005
Springer
16 years 11 hour 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
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 12 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...
ICIAR
2004
Springer
15 years 12 months ago
Real Time Multiple Object Tracking Based on Active Contours
Abstract. In this paper our purpose is to present some solutions to multiple object tracking in an image sequence with a real time constraint and a possible mobile camera. We propo...
Sébastien Lefèvre, Nicole Vincent
CHI
1999
ACM
15 years 10 months ago
Cooperative Inquiry: Developing new Technologies for Children with Children
In today’s homes and schools, children are emerging as frequent and experienced users of technology [3, 14]. As this trend continues, it becomes increasingly important to ask if...
Allison Druin
CIKM
1999
Springer
15 years 10 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...