TopKube: A Rank-Aware Data Cube for Real-Time Exploration of Spatiotemporal Data

F Miranda, L Lins, JT Klosowski… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
From economics to sports to entertainment and social media, ranking objects according to
some notion of importance is a fundamental tool we humans use all the time to better …

A context-aware method for authentically simulating outdoors shadows for mobile augmented reality

J Barreira, M Bessa, L Barbosa… - IEEE transactions on …, 2017 - ieeexplore.ieee.org
Visual coherence between virtual and real objects is a major issue in creating convincing
augmented reality (AR) applications. To achieve this seamless integration, actual light …

User-driven refinement of imprecise queries

B Qarabaqi, M Riedewald - 2014 IEEE 30th International …, 2014 - ieeexplore.ieee.org
We propose techniques for exploratory search in large databases. The goal is to provide
new functionality that aids users in homing in on the right query conditions to find what they …

Ranking under temporal constraints

L Wang, D Metzler, J Lin - Proceedings of the 19th ACM international …, 2010 - dl.acm.org
This paper introduces the notion of temporally constrained ranked retrieval, which, given a
query and a time constraint, produces the best possible ranked list within the specified time …

Cost-aware rank join with random and sorted access

D Martinenghi, M Tagliasacchi - IEEE Transactions on …, 2011 - ieeexplore.ieee.org
In this paper, we address the problem of joining ranked results produced by two or more
services on the web. We consider services endowed with two kinds of access that are often …

Efficient processing of exact top-k queries over disk-resident sorted lists

HH Pang, X Ding, B Zheng - The VLDB Journal, 2010 - Springer
The top-k query is employed in a wide range of applications to generate a ranked list of data
that have the highest aggregate scores over certain attributes. As the pool of attributes for …

Pay-as-you-go approximate join top-k processing for the web of data

A Wagner, V Bicer, T Tran - The Semantic Web: Trends and Challenges …, 2014 - Springer
For effectively searching the Web of data, ranking of results is a crucial. Top-k processing
strategies have been proposed to allow an efficient processing of such ranked queries. Top …

High-performance processing of text queries with tunable pruned term and term pair indexes

A Broschart, R Schenkel - ACM Transactions on Information Systems …, 2012 - dl.acm.org
Term proximity scoring is an established means in information retrieval for improving result
quality of full-text queries. Integrating such proximity scores into efficient query processing …

Optimizing revenue over data-driven assortments

D Sinha, T Tulabandhula - arxiv preprint arxiv:1708.05510, 2017 - arxiv.org
We revisit the problem of large-scale assortment optimization under the multinomial logit
choice model without any assumptions on the structure of the feasible assortments. Scalable …

Asap top-k query processing in unstructured p2p systems

WK Dedzoe, P Lamarre, R Akbarinia… - 2010 IEEE Tenth …, 2010 - ieeexplore.ieee.org
Top-k query processing techniques are useful in unstructured peer-to-peer (P2P) systems, to
avoid overwhelming users with too many results. However, existing approaches suffer from …