Sciweavers

2192 search results - page 145 / 439
» Algorithms for Challenging Motif Problems
Sort
View
IPPS
2010
IEEE
13 years 6 months ago
Highly scalable parallel sorting
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
Edgar Solomonik, Laxmikant V. Kalé
TSP
2010
13 years 3 months ago
Efficient Maximum Entropy Reconstruction of Nuclear Magnetic Resonance T1-T2 Spectra
Abstract--This paper deals with the reconstruction of T1-T2 correlation spectra in nuclear magnetic resonance relaxometry. The ill-posed character and the large size of this invers...
Emilie Chouzenoux, Saïd Moussaoui, Jér...
SECON
2008
IEEE
14 years 2 months ago
Coordinated Locomotion of Mobile Sensor Networks
Stationary wireless sensor networks (WSNs) fail to scale when the area to be monitored is open (i.e borderless) and the physical phenomena to be monitored may migrate through a la...
Seokhoon Yoon, Onur Soysal, Murat Demirbas, Chunmi...
ICCAD
2003
IEEE
219views Hardware» more  ICCAD 2003»
14 years 5 months ago
A Min-Cost Flow Based Detailed Router for FPGAs
Routing for FPGAs has been a very challenging problem due to the limitation of routing resources. Although the FPGA routing problem has been researched extensively, most algorithm...
Seokjin Lee, Yongseok Cheon, Martin D. F. Wong
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 9 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis