612 search results - page 70 / 123 » Using Data Compressors to Construct Rank Tests |
150
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
133
click to vote
ICIP
2003
IEEE
16 years 5 months ago
2003
IEEE
In this paper, we rely on the theory of marked point processes to perform an unsupervised road network extraction from optical and radar images. A road network is modeled by a Mar...
109
click to vote
CLEF
2010
Springer
15 years 5 months ago
2010
Springer
In the context of the CLEF-IP 2010 classification task, we conducted a series of experiments with the Linguistic Classification System (LCS). We compared ment representations for p...
140
click to vote
ICCS
2004
Springer
15 years 9 months ago
2004
Springer
Air pollution models usually start from the computation of the velocity field of a fluid. In this paper, we present a model for computing that field based on the contribution of...
149
Voted
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
We propose a method for learning using a set of feature representations which retrieve different amounts of information at different costs. The goal is to create a more efficient ...