Sciweavers

6045 search results - page 201 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
ISBI
2006
IEEE
14 years 2 months ago
A comparative study of popular interpolation and integration methods for use in computed tomography
We compare various popular methods available for projection and backprojection in CT. Assuming linear rays and a simple density integration along them, we consider both line- and ...
Fang Xu, Klaus Mueller
ICRA
2005
IEEE
145views Robotics» more  ICRA 2005»
14 years 1 months ago
Computation and Graphical Characterization of Robust Multiple-Contact Postures in 2D Gravitational Environments
— This paper is concerned with the problem of identifying robust equilibrium postures of a planar mechanism supported by fixed frictional contacts in a twodimensional gravitation...
Yizhar Or, Elon Rimon
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
14 years 1 months ago
Convergent transfer subgraph characterization and computation
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
Wing Ning Li
ERSA
2010
217views Hardware» more  ERSA 2010»
13 years 6 months ago
FPGA for Computing the Pixel Purity Index Algorithm on Hyperspectral Images
The pixel purity index algorithm is employed in remote sensing for analyzing hyperspectral images. A single pixel usually covers several different materials, and its observed spect...
Carlos González, Daniel Mozos, Javier Resan...
SDMW
2010
Springer
13 years 6 months ago
Computationally Efficient Searchable Symmetric Encryption
Searchable encryption is a technique that allows a client to store documents on a server in encrypted form. Stored documents can be retrieved selectively while revealing as little ...
Peter van Liesdonk, Saeed Sedghi, Jeroen Doumen, P...