Sciweavers

2620 search results - page 148 / 524
» An Evaluation Technique for Binarization Algorithms
Sort
View
IJIT
2004
13 years 9 months ago
Multiresolution Approach to Subpixel Registration by Linear Approximation of PSF
Linear approximation of point spread function (PSF) is a new method for determining subpixel translations between images. The problem with the actual algorithm is the inability of ...
Erol Seke, Kemal Özkan
SOFSEM
2009
Springer
14 years 5 months ago
The Shortcut Problem - Complexity and Approximation
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delli...
ICDM
2005
IEEE
133views Data Mining» more  ICDM 2005»
14 years 1 months ago
Summarization - Compressing Data into an Informative Representation
In this paper, we formulate the problem of summarization of a dataset of transactions with categorical attributes as an optimization problem involving two objective functions - co...
Varun Chandola, Vipin Kumar
TMC
2010
182views more  TMC 2010»
13 years 6 months ago
Rate Adaptation in Congested Wireless Networks through Real-Time Measurements
—Rate adaptation is a critical component that impacts the performance of IEEE 802.11 wireless networks. In congested networks, traditional rate adaptation algorithms have been sh...
Prashanth Aravinda Kumar Acharya, Ashish Sharma, E...
QEST
2009
IEEE
14 years 2 months ago
Language-Level Symmetry Reduction for Probabilistic Model Checking
—Symmetry reduction is a technique for combating state-space explosion in model checking. The generic representatives approach to symmetry reduction uses a language-level transla...
Alastair F. Donaldson, Alice Miller, David Parker