Sciweavers

971 search results - page 68 / 195
» Planning with Reduced Operator Sets
Sort
View
VLDB
2007
ACM
129views Database» more  VLDB 2007»
15 years 10 months ago
Anytime Measures for Top-k Algorithms
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this paper, we initiate research on the anytime b...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 8 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
145
Voted
MMB
1999
Springer
249views Communications» more  MMB 1999»
15 years 8 months ago
A Development Platform for the Design and Optimization of Mobile Radio Networks
The rapidly increasing traffic demand from mobile users forces network operators and service providers to extend and optimize existing networks as well as to plan entirely new mo...
Jürgen Deissner, Gerhard Fettweis, Jörg ...
133
Voted
CGO
2004
IEEE
15 years 8 months ago
Probabilistic Predicate-Aware Modulo Scheduling
Predicated execution enables the removal of branches by converting segments of branching code into sequences of conditional operations. An important side effect of this transforma...
Mikhail Smelyanskiy, Scott A. Mahlke, Edward S. Da...
SIGMOD
2010
ACM
153views Database» more  SIGMOD 2010»
15 years 9 months ago
Threshold query optimization for uncertain data
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...
Yinian Qi, Rohit Jain, Sarvjeet Singh, Sunil Prabh...