Sciweavers

1095 search results - page 22 / 219
» Preprocessing of Intractable Problems
Sort
View
ADBIS
2005
Springer
116views Database» more  ADBIS 2005»
14 years 1 months ago
A Formal Model for the Problem of View Selection for Aggregate Queries
We present a formal analysis of the following view-selection problem: Given a set of queries and a database, return definitions of views that, when materialized in the database, w...
Jingni Li, Zohreh Asgharzadeh Talebi, Rada Chirkov...
FSTTCS
1999
Springer
13 years 12 months ago
A Randomized Algorithm for Flow Shop Scheduling
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
Naveen Garg, Sachin Jain, Chaitanya Swamy
ICCS
2001
Springer
14 years 4 days ago
On Parallel Pseudo-Random Number Generation
Parallel computing has been touted as the pinnacle of high performance digital computing by many. However, many problems remain intractable using deterministic algorithms. Randomiz...
Chih Jeng Kenneth Tan
ISMB
1993
13 years 9 months ago
Finding Relevant Biomolecular Features
Manymethods for analyzing biological problems are constrained by problemsize. Theability to distinguish betweenrelevant andirrelevant features of a problemmay allowa problemto be ...
Lawrence Hunter, Teri E. Klein
CIKM
2010
Springer
13 years 6 months ago
Evaluating, combining and generalizing recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...
Aditya G. Parameswaran, Hector Garcia-Molina, Jeff...