Sciweavers

241 search results - page 8 / 49
» Fast heuristics for large scale covering-location problems
Sort
View
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
14 years 9 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
HPCC
2011
Springer
13 years 9 months ago
Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
Abhinav Bhatele, Laxmikant V. Kalé
CSR
2007
Springer
15 years 3 months ago
Estimation of the Click Volume by Large Scale Regression Analysis
Abstract. How could one estimate the total number of clicks a new advertisement could potentially receive in the current market? This question, called the click volume estimation p...
Yury Lifshits, Dirk Nowotka
ICASSP
2010
IEEE
14 years 9 months ago
Towards large scale distributed coding
This paper considers the problem of distributed source coding for a large sensor network. A typical shortcoming of current approaches to true distributed coding is the exponential...
Sharadh Ramaswamy, Kumar Viswanatha, Ankur Saxena,...
CP
2001
Springer
15 years 2 months ago
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
Peter van Beek, Kent D. Wilken