Sciweavers

461 search results - page 11 / 93
» Splitting NP-Complete Sets
Sort
View
SIGGRAPH
1998
ACM
14 years 3 months ago
Visibility Sorting and Compositing Without Splitting for Image Layer Decompositions
We present an efficient algorithm for visibility sorting a set of moving geometric objects into a sequence of image layers which are composited to produce the final image. Inste...
John M. Snyder, Jed Lengyel
AIPS
2009
14 years 16 hour ago
SAT-Based Parallel Planning Using a Split Representation of Actions
Planning based on propositional SAT(isfiability) is a powerful approach to computing step-optimal plans given a parallel execution semantics. In this setting: (i) a solution plan ...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
JSCIC
2010
231views more  JSCIC 2010»
13 years 5 months ago
Geometric Applications of the Split Bregman Method: Segmentation and Surface Reconstruction
Variational models for image segmentation have many applications, but can be slow to compute. Recently, globally convex segmentation models have been introduced which are very rel...
Tom Goldstein, Xavier Bresson, Stanley Osher
ICML
2003
IEEE
14 years 11 months ago
Decision-tree Induction from Time-series Data Based on a Standard-example Split Test
This paper proposes a novel decision tree for a data set with time-series attributes. Our time-series tree has a value (i.e. a time sequence) of a time-series attribute in its int...
Yuu Yamada, Einoshin Suzuki, Hideto Yokoi, Katsuhi...
TIP
2010
163views more  TIP 2010»
13 years 5 months ago
Fast Image Recovery Using Variable Splitting and Constrained Optimization
We propose a new fast algorithm for solving one of the standard formulations of image restoration and reconstruction which consists of an unconstrained optimization problem where t...
Manya V. Afonso, José M. Bioucas-Dias, M&aa...