Sciweavers

1092 search results - page 76 / 219
» Convex Methods for Transduction
Sort
View
WIOPT
2010
IEEE
13 years 8 months ago
Optimal slotted random access in coded wireless packet networks
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...
Maximilian Riemensberger, Michael Heindlmaier, And...
IJCV
2012
12 years 16 days ago
Sparse Occlusion Detection with Optical Flow
Abstract We tackle the problem of detecting occluded regions in a video stream. Under assumptions of Lambertian reflection and static illumination, the task can be posed as a vari...
Alper Ayvaci, Michalis Raptis, Stefano Soatto
ICIP
2007
IEEE
14 years 11 months ago
An Efficient Method for Compressed Sensing
Compressed sensing or compressive sampling (CS) has been receiving a lot of interest as a promising method for signal recovery and sampling. CS problems can be cast as convex prob...
Seung-Jean Kim, Kwangmoo Koh, Michael Lustig, Step...
ICCS
2009
Springer
14 years 4 months ago
Explicit Time Stepping Methods with High Stage Order and Monotonicity Properties
This paper introduces a three and a four order explicit time stepping method. These methods have high stage order and favorable monotonicity properties. The proposed methods are ba...
Emil M. Constantinescu, Adrian Sandu
EOR
2007
105views more  EOR 2007»
13 years 10 months ago
Newton's method and its use in optimization
Newton’s method is a basic tool in numerical analysis and numerous applications, including operations research and data mining. We survey the history of the method, its main ide...
Boris T. Polyak