Sciweavers

17760 search results - page 3518 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
134
Voted
ICPR
2010
IEEE
15 years 1 months ago
Boosting Bayesian MAP Classification
In this paper we redefine and generalize the classic k-nearest neighbors (k-NN) voting rule in a Bayesian maximum-a-posteriori (MAP) framework. Therefore, annotated examples are u...
Paolo Piro, Richard Nock, Frank Nielsen, Michel Ba...
146
Voted
IMC
2010
ACM
15 years 1 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
137
Voted
IPPS
2010
IEEE
15 years 1 months ago
Exploring parallelism in short sequence mapping using Burrows-Wheeler Transform
Next-generation high throughput sequencing instruments are capable of generating hundreds of millions of reads in a single run. Mapping those reads to a reference genome is an ext...
Doruk Bozdag, Ayat Hatem, Ümit V. Çata...
134
Voted
IS
2010
15 years 1 months ago
Building concepts for AI agents using information theoretic Co-clustering
Abstract--High level conceptual thought seems to be at the basis of the impressive human cognitive ability, and AI researchers aim to replicate this ability in artificial agents. C...
Jason R. Chen
129
Voted
JACM
2000
131views more  JACM 2000»
15 years 3 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
« Prev « First page 3518 / 3552 Last » Next »