Sciweavers

3250 search results - page 157 / 650
» An Algorithm to Solve a Linear Program
Sort
View
EOR
2010
103views more  EOR 2010»
15 years 6 months ago
Exploiting special structure in semidefinite programming: A survey of theory and applications
Semidefinite Programming (SDP) may be seen as a generalization of Linear Programming (LP). In particular, one may extend interior point algorithms for LP to SDP, but it has proven...
Etienne de Klerk
IWANN
2007
Springer
16 years 11 days ago
Multiple Instance Learning with Genetic Programming for Web Mining
Abstract. The aim of this paper is to present a new tool of multiple instance learning which is designed using a grammar based genetic programming (GGP) algorithm. We study its app...
Amelia Zafra, Sebastián Ventura, Enrique He...
TMM
2002
81views more  TMM 2002»
15 years 5 months ago
Staggered push - a linearly scalable architecture for push-based parallel video servers
With the rapid performance improvements in low-cost PCs, it becomes increasingly practical and cost-effective to implement large-scale video-on-demand (VoD) systems around parallel...
Jack Y. B. Lee
TSP
2010
15 years 28 days ago
Efficient recursive estimators for a linear, time-varying Gaussian model with general constraints
The adaptive estimation of a time-varying parameter vector in a linear Gaussian model is considered where we a priori know that the parameter vector belongs to a known arbitrary s...
Stefan Uhlich, Bin Yang
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
15 years 10 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert