Sciweavers

85 search results - page 10 / 17
» Feasible Region Approximation Using Convex Polytopes
Sort
View
IJCV
2012
11 years 10 months 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
PODS
2004
ACM
207views Database» more  PODS 2004»
14 years 7 months ago
Adaptive Sampling for Geometric Problems over Data Streams
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...
John Hershberger, Subhash Suri
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
13 years 9 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
WONS
2012
IEEE
12 years 3 months ago
Obfuscating IEEE 802.15.4 communication using secret spreading codes
—The IEEE 802.15.4 standard specifies an M-ary spread spectrum system with public and fixed spreading sequences. We propose instead to use secret and dynamic, random spreading ...
Bjorn Muntwyler, Vincent Lenders, Franck Legendre,...
MICCAI
2006
Springer
14 years 8 months ago
Extrapolating Tumor Invasion Margins for Physiologically Determined Radiotherapy Regions
Abstract. In radiotherapy, the constant margin taken around the visible tumor is a very coarse approximation of the invasion margin of cancerous cells. In this article, a new formu...
Ender Konukoglu, Olivier Clatz, Pierre-Yves Bondia...