Sciweavers

2040 search results - page 234 / 408
» Approximate Expectation Maximization
Sort
View
147
Voted
IPPS
2009
IEEE
15 years 10 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
141
Voted
TAMC
2009
Springer
15 years 10 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
131
Voted
ESA
2007
Springer
150views Algorithms» more  ESA 2007»
15 years 9 months ago
On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems
We study the problem of scheduling transmissions on the downlink of IEEE 802.16/WiMAX systems that use the OFDMA technology. These transmissions are scheduled using a matrix whose...
Amos Israeli, Dror Rawitz, Oran Sharon
131
Voted
3DPVT
2006
IEEE
224views Visualization» more  3DPVT 2006»
15 years 9 months ago
A Bayesian Approach to Building Footprint Extraction from Aerial LIDAR Data
Building footprints have been shown to be extremely useful in urban planning, infrastructure development, and roof modeling. Current methods for creating these footprints are ofte...
Oliver Wang, Suresh K. Lodha, David P. Helmbold
129
Voted
3DPVT
2006
IEEE
202views Visualization» more  3DPVT 2006»
15 years 9 months ago
Visual Shapes of Silhouette Sets
Shape from silhouette methods are extensively used to model dynamic and non-rigid objects using binary foreground-background images. Since the problem of reconstructing shapes fro...
Jean-Sébastien Franco, Marc Lapierre, Edmon...