Sciweavers

35 search results - page 4 / 7
» The complexity of cover inequality separation
Sort
View
AMC
2010
175views more  AMC 2010»
13 years 8 months ago
An inexact parallel splitting augmented Lagrangian method for large system of linear equations
: Parallel iterative methods are powerful tool for solving large system of linear equations (LEs). The existing parallel computing research results are focussed mainly on sparse sy...
Zheng Peng, DongHua Wu
TRIDENTCOM
2010
IEEE
13 years 5 months ago
FIT: Future Internet Toolbox
Prototyping future Internet technologies is an important but complicated task, mainly caused by incompatibilities to existing systems and high implementation complexity. To reduce ...
Thorsten Biermann, Christian Dannewitz, Holger Kar...
MOR
2008
169views more  MOR 2008»
13 years 7 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
COLT
2007
Springer
13 years 11 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...
TVCG
2010
161views more  TVCG 2010»
13 years 6 months ago
Origamizing Polyhedral Surfaces
—This paper presents the first practical method for “origamizing” or obtaining the folding pattern that folds a single sheet of material into a given polyhedral surface with...
Tomohiro Tachi