Sciweavers

447 search results - page 38 / 90
» Approximation Algorithms for the Discrete Time-Cost Tradeoff...
Sort
View
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
15 years 3 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
CPM
2009
Springer
94views Combinatorics» more  CPM 2009»
16 years 15 days ago
Online Approximate Matching with Non-local Distances
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
Raphaël Clifford, Benjamin Sach
IAJIT
2008
201views more  IAJIT 2008»
15 years 6 months ago
Implementation of a Novel Efficient Multiwavelet Based Video Coding Algorithm
: The recent explosion in digital video storage and delivery has presented strong motivation for high performance video compression solutions. An efficient video compression techni...
Sudhakar Radhakrishnan, Jayaraman Subramaniam
ICML
2004
IEEE
16 years 6 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
CISS
2008
IEEE
16 years 12 days ago
Distributed processing in frames for sparse approximation
—Beyond signal processing applications, frames are also powerful tools for modeling the sensing and information processing of many biological and man-made systems that exhibit in...
Christopher J. Rozell