2080 search results - page 104 / 416 » Measuring empirical computational complexity |
136
click to vote
BIRTHDAY
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
112
click to vote
WCRE
2006
IEEE
15 years 10 months ago
2006
IEEE
Software applications typically have many features that vary in their similarity. We define a measurement of similarity between pairs of features based on their underlying implem...
154
click to vote
IJCV
2010
15 years 2 months ago
2010
We develop a computational model of shape that extends existing Riemannian models of shape of curves to multidimensional objects of general topological type. We construct shape sp...
118
click to vote
AMAI
2004
Springer
15 years 9 months ago
2004
Springer
In reasoning tasks involving logical formulas, high expressiveness is desirable, although it often leads to high computational complexity. We study a simple measure of expressiven...
141
click to vote
ANCS
2005
ACM
15 years 9 months ago
2005
ACM
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...