Sciweavers

4432 search results - page 508 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
15 years 10 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
ICIP
2004
IEEE
16 years 5 months ago
Estimation of mixtures of probabilistic pca with stochastic em for the 3d biplanar reconstruction of scoliotic rib cage
In this paper, we present a robust method for estimating the model parameters in a mixture of probabilistic principal component analyzers. This method is based on the Stochastic v...
François Destrempes, Jacques A. de Guise, M...
INFOCOM
2007
IEEE
15 years 10 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
HPCC
2007
Springer
15 years 10 months ago
Software Pipelining for Packet Filters
Packet filters play an essential role in traffic management and security management on the Internet. In order to create software-based packet filters that are fast enough to work...
Yoshiyuki Yamashita, Masato Tsuru
PLDI
2004
ACM
15 years 9 months ago
Inducing heuristics to decide whether to schedule
Instruction scheduling is a compiler optimization that can improve program speed, sometimes by 10% or more—but it can also be expensive. Furthermore, time spent optimizing is mo...
John Cavazos, J. Eliot B. Moss