Sciweavers

13214 search results - page 2265 / 2643
» Pseudorandomness for network algorithms
Sort
View
TPDS
1998
118views more  TPDS 1998»
15 years 6 months ago
Optimizing Computing Costs Using Divisible Load Analysis
—A bus oriented network where there is a charge for the amount of divisible load processed on each processor is investigated. A cost optimal processor sequencing result is found ...
Jeeho Sohn, Thomas G. Robertazzi, Serge Luryi
ICPR
2010
IEEE
15 years 5 months ago
Data-Driven Lung Nodule Models for Robust Nodule Detection in Chest CT
The quality of the lung nodule models determines the success of lung nodule detection. This paper describes aspects of our data-driven approach for modeling lung nodules using the...
Amal Farag, James Graham, Aly A. Farag
ATMOS
2010
136views Optimization» more  ATMOS 2010»
15 years 5 months ago
An Empirical Analysis of Robustness Concepts for Timetabling
Calculating timetables that are insensitive to disturbances has drawn considerable research efforts due to its practical importance on the one hand and its hard tractability by c...
Marc Goerigk, Anita Schöbel
CORR
2010
Springer
282views Education» more  CORR 2010»
15 years 5 months ago
A New Approach in Packet Scheduling in the Vanet
Vehicular Ad hoc Networks (VANET) are expected to have great potential to improve both traffic safety and comfort in the future. When many vehicles want to access data through roa...
Sayadi Mohammad Javad, Fathy Mahmood
IJON
2010
94views more  IJON 2010»
15 years 5 months ago
Optimizing an organized modularity measure for topographic graph clustering: A deterministic annealing approach
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure prod...
Fabrice Rossi, Nathalie Villa-Vialaneix
« Prev « First page 2265 / 2643 Last » Next »