8413 search results - page 239 / 1683 » Ordering Problem Subgoals |
132
Voted
COCOON
2009
Springer
15 years 6 months ago
2009
Springer
We present new and more efficient algorithms for regular language enumeration problems. The min-word problem is to find the lexicographically minimal word of length n accepted by ...
100
click to vote
INFORMATICALT
2002
15 years 2 months ago
2002
This article presents the ways of identification, selection and transformation of the data into other structures. Relation selection and transformation may change data quantity and...
112
click to vote
SCALESPACE
2007
Springer
15 years 9 months ago
2007
Springer
In this work, we address the problem of segmenting multiple objects, under possible occlusions, in a level set framework. A variational energy that incorporates a piecewise constan...
103
click to vote
SAC
2005
ACM
15 years 8 months ago
2005
ACM
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
126
click to vote
JGT
2011
14 years 9 months ago
2011
Let G and H be two graphs of order n. If we place copies of G and H on a common vertex set, how much or little can they be made to overlap? The aim of this paper is to provide som...