Sciweavers

2255 search results - page 289 / 451
» Computing a Center-Transversal Line
Sort
View
CONEXT
2010
ACM
14 years 9 months ago
Assessing the vulnerability of replicated network services
Client-server networks are pervasive, fundamental, and include such key networks as the Internet, power grids, and road networks. In a client-server network, clients obtain a serv...
George Dean Bissias, Brian Neil Levine, Ramesh K. ...
IEEECIT
2010
IEEE
14 years 9 months ago
Memory Saving Discrete Fourier Transform on GPUs
This paper will show an alternative method to compute the two-dimensional Discrete Fourier Transform. While current GPU Fourier transform libraries need a large buffer for storing ...
Daniel Kauker, Harald Sanftmann, Steffen Frey, Tho...
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
14 years 9 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
Jinhui Xu, Lei Xu, Yulai Xie
AND
2009
14 years 9 months ago
Edge noise in document images
A degradation model that describes many image degradations produced by desktop scanning is used to study the edge noise that is present in bilevel document images. The standard de...
Craig McGillivary, Chris Hale, Elisa H. Barney Smi...
ICCV
2009
IEEE
14 years 9 months ago
Local distance functions: A taxonomy, new algorithms, and an evaluation
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
Deva Ramanan, Simon Baker