4118 search results - page 635 / 824 » Efficient Algorithms for Airline Problem |
111
click to vote
WWW
2002
ACM
16 years 5 months ago
2002
ACM
We addressed two issues concerning the practical aspects of optimally scheduling web advertising proposed by Langheinrich et al. [5], which scheduling maximizes the total number o...
276
Voted
ASPLOS
2009
ACM
16 years 5 months ago
2009
ACM
QR decomposition is a computationally intensive linear algebra operation that factors a matrix A into the product of a unitary matrix Q and upper triangular matrix R. Adaptive sys...
136
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Probabilistic frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied to standard "certain&quo...
148
click to vote
KDD
2002
ACM
16 years 4 months ago
2002
ACM
Support vector machines (SVMs) excel at two-class discriminative learning problems. They often outperform generative classifiers, especially those that use inaccurate generative m...
132
click to vote
RECOMB
2007
Springer
16 years 4 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...