2254 search results - page 180 / 451 » Computing the minimal covering set |
219
click to vote
COMPGEOM
2006
ACM
16 years 18 days ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
177
click to vote
ACIVS
2005
Springer
16 years 5 days ago
2005
Springer
We describe a method for removing quantization artifacts (de-quantizing) in the image domain, by enforcing a high degree of sparseness in its representation with an overcomplete or...
209
click to vote
ICCV
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents a novel variational method for supervised texture segmentation. The textured feature space is generated by filtering the given textured images using isotropic ...
180
Voted
DAC
1994
ACM
15 years 10 months ago
1994
ACM
Previous attempts to capture the phenomenon of output don't care sequencesfor a componentin an FSM network have been incomplete. We demonstrate that output don't care se...
184
click to vote
CORR
2008
Springer
2008
Springer
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
15 years 6 months ago
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...