11182 search results - page 326 / 2237 » Shape Analysis of Sets |
174
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
152
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
192
click to vote
ECRTS
2004
IEEE
15 years 10 months ago
2004
IEEE
The problem of feasibility analysis for asynchronous periodic task sets (i.e. where tasks can have an initial offset) is known to be co-NP-complete in the strong sense. A sufficie...
196
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
186
click to vote
ADVIS
2004
Springer
16 years 5 days ago
2004
Springer
An important issue in text mining is how to make use of multiple pieces knowledge discovered to improve future decisions. In this paper, we propose a new approach to combining mult...