Sciweavers

792 search results - page 63 / 159
» Computing Iceberg Queries Efficiently
Sort
View
ICWS
2009
IEEE
15 years 7 months ago
Enabling Scaleable, Efficient, Non-visual Web Browsing Services
Over the last few decades, the discipline of Web Accessibility has been focused on building more efficient and more effective speech generators for Web Browsers. The visual browse...
Ashish Verma, Tyrone Grandison, Himanshu Chauhan
ICDE
2006
IEEE
192views Database» more  ICDE 2006»
15 years 11 months ago
MAPLE: A Mobile Scalable P2P Nearest Neighbor Query System for Location-based Services
In this demonstration we present MAPLE, a scalable peer-to-peer Nearest Neighbor (NN) query system for mobile environments. MAPLE is designed for the efficient sharing of query re...
Wei-Shinn Ku, Roger Zimmermann, Chi-Ngai Wan, Haoj...
EDBT
2000
ACM
15 years 1 months ago
Management and Query Processing of One-Dimensional Intervals with the UB-Tree
The management and query processing of one dimensional intervals is a special case of extended object handling. One dimensional intervals play an important role in temporal databa...
Robert Fenk
PODS
2006
ACM
217views Database» more  PODS 2006»
15 years 10 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
ICLP
2010
Springer
15 years 1 months ago
Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
Daan Fierens