Sciweavers

411 search results - page 37 / 83
» Efficient View Maintenance Using Version Numbers
Sort
View
ICDE
2010
IEEE
568views Database» more  ICDE 2010»
15 years 9 months ago
Reverse Top-k Queries
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
JUCS
2008
156views more  JUCS 2008»
14 years 9 months ago
Efficient k-out-of-n Oblivious Transfer Schemes
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...
Cheng-Kang Chu, Wen-Guey Tzeng
MST
2002
128views more  MST 2002»
14 years 9 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
CHARME
2003
Springer
110views Hardware» more  CHARME 2003»
15 years 1 months ago
Exact and Efficient Verification of Parameterized Cache Coherence Protocols
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
E. Allen Emerson, Vineet Kahlon
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
14 years 9 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang