Sciweavers

2636 search results - page 462 / 528
» Linear Programming
Sort
View
NIPS
2000
14 years 11 months ago
A New Approximate Maximal Margin Classification Algorithm
A new incremental learning algorithm is described which approximates the maximal margin hyperplane w.r.t. norm p 2 for a set of linearly separable data. Our algorithm, called alm...
Claudio Gentile
ESA
2010
Springer
170views Algorithms» more  ESA 2010»
14 years 11 months ago
Streaming Graph Computations with a Helpful Advisor
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...
Graham Cormode, Michael Mitzenmacher, Justin Thale...
BMCBI
2008
111views more  BMCBI 2008»
14 years 10 months ago
Protein contact order prediction from primary sequences
Background: Contact order is a topological descriptor that has been shown to be correlated with several interesting protein properties such as protein folding rates and protein tr...
Yi Shi, Jianjun Zhou, David Arndt, David S. Wishar...
CORR
2008
Springer
77views Education» more  CORR 2008»
14 years 10 months ago
Energy-efficient Scheduling of Delay Constrained Traffic over Fading Channels
Abstract--A delay-constrained scheduling problem for pointto-point communication is considered: a packet of B bits must be transmitted by a hard deadline of T slots over a timevary...
Juyul Lee, Nihar Jindal
FMSD
2006
104views more  FMSD 2006»
14 years 9 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord