13457 search results - page 22 / 2692 » Can we elect if we cannot compare |
CSE
2009
IEEE
13 years 11 months ago
2009
IEEE
Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architectur...
ITCC
2005
IEEE
14 years 1 months ago
2005
IEEE
Shape is one of the fundamental visual features in the Content-based Image Retrieval (CBIR) paradigm. Numerous shape descriptors have been proposed in the literature. These can be...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—The paper presents a novel integrated MAC/routing scheme for wireless sensor networking. Our design objective is to elect the next hop for data forwarding by minimizing the numb...
APAL
2006
13 years 7 months ago
2006
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
MOC
2000
13 years 7 months ago
2000
In this paper we construct elliptic boundary value problems whose standard finite element approximations converge arbitrarily slowly in the energy norm, and show that adaptive proc...