Sciweavers

2543 search results - page 262 / 509
» Optimal Ordered Problem Solver
Sort
View
WIA
2009
Springer
15 years 9 months ago
Short Regular Expressions from Finite Automata: Empirical Results
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
Hermann Gruber, Markus Holzer, Michael Tautschnig
ISVC
2005
Springer
15 years 8 months ago
A Vectorial Self-dual Morphological Filter Based on Total Variation Minimization
We present a vectorial self dual morphological filter. Contrary to many methods, our approach does not require the use of an ordering on vectors. It relies on the minimization of ...
Jérôme Darbon, Sylvain Peyronnet
ICIP
2010
IEEE
15 years 1 months ago
Total subset variation prior
We propose total subset variation (TSV), a convexity preserving generalization of the total variation (TV) prior, for higher order clique MRF. A proposed differentiable approximat...
Sanjeev Kumar, Truong Q. Nguyen
CPM
2010
Springer
145views Combinatorics» more  CPM 2010»
14 years 10 months ago
Succinct Representations of Separable Graphs
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...
Guy E. Blelloch, Arash Farzan
AI
1998
Springer
15 years 2 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf