Sciweavers

612 search results - page 7 / 123
» Using Data Compressors to Construct Rank Tests
Sort
View
GEOINFORMATICA
1998
107views more  GEOINFORMATICA 1998»
14 years 9 months ago
A Comparison of Two Approaches to Ranking Algorithms Used to Compute Hill Slopes
The calculation of slope (downhill gradient) for a point in a digital elevation model (DEM) is a common procedure in the hydrological, environmental and remote sensing sciences. T...
Kevin H. Jones
ICASSP
2011
IEEE
14 years 1 months ago
A paired test for recognizer selection with untranscribed data
Traditionally, the use of untranscribed speech has been restricted to unsupervised or semi-supervised training of acoustic models. Comparison of recognizers has required labeled d...
Bhiksha Raj, Rita Singh, James Baker
BMCBI
2005
152views more  BMCBI 2005»
14 years 10 months ago
Ranking the whole MEDLINE database according to a large training set using text indexing
Background: The MEDLINE database contains over 12 million references to scientific literature, ut 3/4 of recent articles including an abstract of the publication. Retrieval of ent...
Brian P. Suomela, Miguel A. Andrade
TMM
2002
109views more  TMM 2002»
14 years 9 months ago
Smart rebinning for the compression of concentric mosaic
The concentric mosaic offers a quick solution to construct a virtual copy of a real environment, and to navigate in that virtual environment. However, the huge amount of data asso...
Yunnan Wu, Cha Zhang, Jin Li
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
15 years 4 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson