Sciweavers

7930 search results - page 296 / 1586
» Greedy in Approximation Algorithms
Sort
View
IPPS
2002
IEEE
15 years 11 months ago
Static Mapping Heuristics for Tasks with Dependencies, Priorities, Deadlines, and Multiple Versions in Heterogeneous Environment
Heterogeneous computing (HC) environments composed of interconnected machines with varied computational capabilities are well suited to meet the computational demands of large, di...
Tracy D. Braun, Howard Jay Siegel, Anthony A. Maci...
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
15 years 10 months ago
Implementing Data Cubes Efficiently
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ull...
ISMB
1998
15 years 8 months ago
Automated Clustering and Assembly of Large EST Collections
The avMlability of large EST(Expressed Sequence Tag)databases has led to a revolution in the waynew genes are cloned. Difficulties arise, however,due to high error rates and redun...
David P. Yee, Darrell Conklin
ASC
2008
15 years 6 months ago
Evolving a Bayesian classifier for ECG-based age classification in medical applications
Abstract. Objective: Age classification of patients based on information extracted from electrocardiograms (ECG's). The scope of this work is to develop and compare the perfor...
M. Wiggins, A. Saad, Brian Litt, George J. Vachtse...
FOCM
2008
156views more  FOCM 2008»
15 years 6 months ago
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
Stefan Kunis, Holger Rauhut