Sciweavers

1004 search results - page 124 / 201
» A comparison of generalized linear discriminant analysis alg...
Sort
View
ICLP
1997
Springer
15 years 4 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
SIGIR
2008
ACM
14 years 11 months ago
Directly optimizing evaluation measures in learning to rank
One of the central issues in learning to rank for information retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures used in i...
Jun Xu, Tie-Yan Liu, Min Lu, Hang Li, Wei-Ying Ma
ICALP
1993
Springer
15 years 4 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
WWW
2009
ACM
16 years 16 days ago
Crosslanguage blog mining and trend visualisation
People use weblogs to express thoughts, present ideas and share knowledge, therefore weblogs are extraordinarily valuable resources, amongs others, for trend analysis. Trends are ...
Andreas Juffinger, Elisabeth Lex
BMCBI
2006
192views more  BMCBI 2006»
14 years 12 months ago
Analysis of circular genome rearrangement by fusions, fissions and block-interchanges
Background: Analysis of genomes evolving via block-interchange events leads to a combinatorial problem of sorting by block-interchanges, which has been studied recently to evaluat...
Chin Lung Lu, Yen-Lin Huang, Tsui Ching Wang, Hsie...