1985 search results - page 18 / 397 » A Minimal Periods Algorithm with Applications |
ACMSE
2006
ACM
15 years 3 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
88
Voted
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper we introduce a novel edge-based, implicit approach for single object segmentation in 3D images. From a couple of curves, traced by the user on the object to be segme...
85
Voted
SAT
2005
Springer
15 years 3 months ago
2005
Springer
We tackle the problem of finding a smallest-cardinality MUS (SMUS) of a given formula. The SMUS provides a succinct explanation of infeasibility and is valuable for applications th...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
64
Voted
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...