Sciweavers

103 search results - page 4 / 21
» K -Trivial Closed Sets and Continuous Functions
Sort
View
CCCG
2007
13 years 9 months ago
Contraction and Expansion of Convex Sets
Let S be a set system of convex sets in Rd . Helly’s theorem states that if all sets in S have empty intersection, then there is a subset S′ ⊂ S of size d+1 which also has e...
Michael Langberg, Leonard J. Schulman
JMLR
2006
116views more  JMLR 2006»
13 years 7 months ago
Point-Based Value Iteration for Continuous POMDPs
We propose a novel approach to optimize Partially Observable Markov Decisions Processes (POMDPs) defined on continuous spaces. To date, most algorithms for model-based POMDPs are ...
Josep M. Porta, Nikos A. Vlassis, Matthijs T. J. S...
SIAMSC
2008
237views more  SIAMSC 2008»
13 years 7 months ago
A Variational Shape Optimization Approach for Image Segmentation with a Mumford--Shah Functional
We introduce a novel computational method for a Mumford-Shah functional, which decomposes a given image into smooth regions separated by closed curves. Casting this as a shape opti...
Günay Dogan, Pedro Morin, Ricardo H. Nochetto
CORR
2011
Springer
162views Education» more  CORR 2011»
12 years 11 months ago
Homology and Robustness of Level and Interlevel Sets
Given a function f : X → R on a topological space, we consider the preimages of intervals and their homology groups and show how to read the ranks of these groups from the exten...
Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozo...
WAOA
2007
Springer
109views Algorithms» more  WAOA 2007»
14 years 1 months ago
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
Leah Epstein, Rob van Stee