Sciweavers

1985 search results - page 265 / 397
» A Minimal Periods Algorithm with Applications
Sort
View
219
Voted
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
16 years 3 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng
ADHOC
2007
144views more  ADHOC 2007»
15 years 3 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
13 years 5 months ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 3 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
151
Voted
BMCBI
2011
14 years 10 months ago
SNPPicker: High quality tag SNP selection across multiple populations
Background: Linkage Disequilibrium (LD) bin-tagging algorithms identify a reduced set of tag SNPs that can capture the genetic variation in a population without genotyping every s...
Hugues Sicotte, David N. Rider, Gregory A. Poland,...