Sciweavers

392 search results - page 17 / 79
» Maximal Completion
Sort
View
JPDC
2006
93views more  JPDC 2006»
13 years 7 months ago
Fault-tolerant multicasting in hypercubes using local safety information
A fully unsafe hypercube according to the global safety can be split into a unique set of maximal safe subcubes. Multicasting in a maximal safe subcube can be completed reliably b...
Dong Xiang, Ai Chen, Jia-Guang Sun
EOR
2008
82views more  EOR 2008»
13 years 7 months ago
Solving the pallet loading problem
This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All boxe...
Gustavo H. A. Martins, Robert F. Dell
CCR
2006
82views more  CCR 2006»
13 years 7 months ago
Why flow-completion time is the right metric for congestion control
Users typically want their flows to complete as quickly as possible: They want a web-page to download quickly, or a file transfer to complete as rapidly as possible. In other words...
Nandita Dukkipati, Nick McKeown
SSPR
2004
Springer
14 years 1 months ago
An Optimal Probabilistic Graphical Model for Point Set Matching
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
Tibério S. Caetano, Terry Caelli, Dante Aug...
FGR
2004
IEEE
130views Biometrics» more  FGR 2004»
13 years 11 months ago
Sparse Models for Gender Classification
A class of sparse regularization functions are considered for the developing sparse classifiers for determining facial gender. The sparse classification method aims to both select...
Nicholas Costen, Martin Brown, Shigeru Akamatsu