Sciweavers

3466 search results - page 435 / 694
» Fast computation of special resultants
Sort
View
JMLR
2006
93views more  JMLR 2006»
15 years 6 months ago
An Efficient Implementation of an Active Set Method for SVMs
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
Katya Scheinberg
ANOR
2005
56views more  ANOR 2005»
15 years 6 months ago
Two-Machine Flowshop Batching and Scheduling
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...
Bertrand M. T. Lin, T. C. Edwin Cheng
PAMI
2007
176views more  PAMI 2007»
15 years 6 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas

Publication
184views
17 years 5 months ago
Design and Evaluation of Feedback Consolidation for ABR Point-to-Multipoint Connections in ATM Networks
The available bit rate (ABR) service is proposed to transport data traffic in asynchronous transfer mode (ATM) networks. ABR is unique because the network switches can indicate to ...
Sonia Fahmy, Raj Jain, Rohit Goyal, Bobby Vandalor...

Publication
196views
17 years 5 months ago
Improving the Performance of TCP over the ATM-UBR service
In this paper we study the design issues in improving TCP performance over the ATM UBR service. ATM-UBR switches respond to congestion by dropping cells when their buffers become f...
Rohit Goyal, Raj Jain, Shiv Kalyanaraman, Sonia Fa...