5105 search results - page 203 / 1021 » An algorithm to determine peer-reviewers |
141
click to vote
IANDC
2010
15 years 5 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
208
click to vote
TSP
2012
14 years 2 months ago
2012
—In a cognitive radio network, opportunistic spectrum access (OSA) to the underutilized spectrum involves not only sensing the spectrum occupancy but also probing the channel qua...
154
click to vote
ICIP
2000
IEEE
16 years 8 months ago
2000
IEEE
In this paper, we develop a framework for efficiently encoding predictive error frames (PEF) as part of a rate scalable, wavelet-based video compression algorithm. We investigate ...
139
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
In this paper, we study the problem of learning phylogenies and hidden Markov models. We call the Markov model nonsingular if all transtion matrices have determinants bounded away...
157
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents an algorithm designed to compute the perceived interest of objects in images. We measured likelihood functions via a psychophysical experiment in which subject...