10890 search results - page 117 / 2178 » Automatic Complexity Analysis |
159
Voted
ICSM
2003
IEEE
15 years 7 months ago
2003
IEEE
In object oriented programming, the functionalities of a system result from the interactions (message exchanges) among the objects allocated by the system. While designing object ...
124
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper presents the Pure/Epos approach to deal with the high complexity of adaptable operating systems and also to diminish the distance between application and operating syste...
126
click to vote
SSPR
1998
Springer
15 years 6 months ago
1998
Springer
: We present a practical approach to nonparametric cluster analysis of large data sets. The number of clusters and the cluster centres are automatically derived by mode seeking wit...
AISC
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Assumptions about the domains of partial functions are necessary in state-of-the-art proof assistants. On the other hand when mathematicians write about partial functions...
108
click to vote
DOCENG
2008
ACM
15 years 4 months ago
2008
ACM
: Variable data documents can be considered as functions of their bindings to values, and this function could be arbitrarily complex to build strongly-customised but high-value doc...