7106 search results - page 230 / 1422 » Restricted Complexity, General Complexity |
178
click to vote
SMA
2009
ACM
15 years 10 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
155
click to vote
ICMCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We present an implementation of general FFTs for graphics processing units (GPUs). Unlike most existing GPU FFT implementations, we handle both complex and real data of any size t...
138
Voted
PIMRC
2008
IEEE
15 years 10 months ago
2008
IEEE
– In this paper, we propose a decomposition method called Generalized Multi-Unitary Decomposition (GMUD) which is useful in multi-user MIMO precoding. This decomposition transfor...
155
click to vote
IROS
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— We study the problem of registering local relative pose estimates to produce a global consistent trajectory of a moving robot. Traditionally, this problem has been stud...
145
click to vote
SMI
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a novel 3D shape descriptor "The Generalized Shape Distributions" for effective shape matching and analysis, by taking advantage of both local and gl...