Sciweavers

3086 search results - page 542 / 618
» Generalized Discriminant Analysis Using a Kernel Approach
Sort
View
SIGPRO
2008
151views more  SIGPRO 2008»
13 years 7 months ago
An adaptive penalized maximum likelihood algorithm
The LMS algorithm is one of the most popular learning algorithms for identifying an unknown system. Many variants of the algorithm have been developed based on different problem f...
Guang Deng, Wai-Yin Ng
COMPUTER
2004
90views more  COMPUTER 2004»
13 years 7 months ago
Languages and the Computing Profession
highly abstracted. The Chinese writing system uses logographs--conventional representations of words or morphemes. Characters of the most common kind have two parts, one suggesting...
W. Neville Holmes
JACM
2002
94views more  JACM 2002»
13 years 7 months ago
The greedy path-merging algorithm for contig scaffolding
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
Daniel H. Huson, Knut Reinert, Eugene W. Myers
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 6 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase
PKDD
2010
Springer
313views Data Mining» more  PKDD 2010»
13 years 6 months ago
Topic Modeling for Personalized Recommendation of Volatile Items
One of the major strengths of probabilistic topic modeling is the ability to reveal hidden relations via the analysis of co-occurrence patterns on dyadic observations, such as docu...
Maks Ovsjanikov, Ye Chen