79 search results - page 1 / 16 » Worst-case analysis of generalized heapsort algorithm revisi... |
30
Voted
IJCM
2006
14 years 9 months ago
2006
DAC
2002
ACM
15 years 10 months ago
2002
ACM
CT The traditional approach to worst-case static-timing analysis is becoming unacceptably conservative due to an ever-increasing number of circuit and process effects. We propose a...
JMLR
2006
14 years 9 months ago
2006
A selective sampling algorithm is a learning algorithm for classification that, based on the past observed data, decides whether to ask the label of each new instance to be classi...
88
Voted
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
DAC
2004
ACM
15 years 10 months ago
2004
ACM
ion of Assembler Programs for Symbolic Worst Case Execution Time Analysis Tobias Schuele Tobias.Schuele@informatik.uni-kl.de Klaus Schneider Klaus.Schneider@informatik.uni-kl.de Re...