Sciweavers

4860 search results - page 62 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
105
Voted
MFCS
2004
Springer
15 years 9 months ago
Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms
Abstract. Problem parameters are ubiquitous. In every area of computer science, we find all kinds of “special aspects” to the problems encountered. Hence, the study of paramet...
Rolf Niedermeier
134
Voted
ICML
2005
IEEE
16 years 4 months ago
Core Vector Regression for very large regression problems
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
Ivor W. Tsang, James T. Kwok, Kimo T. Lai
147
Voted
BMCBI
2006
95views more  BMCBI 2006»
15 years 3 months ago
Estimate haplotype frequencies in pedigrees
Background: Haplotype analysis has gained increasing attention in the context of association studies of disease genes and drug responsivities over the last years. The potential us...
Qiangfeng Zhang, YuZhong Zhao, Guoliang Chen, Yun ...
167
Voted
ATAL
2010
Springer
15 years 4 months ago
Parameterizing the winner determination problem for combinatorial auctions
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
David Loker, Kate Larson
149
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
Inclusion-exclusion formulas from independent complexes
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
Dominique Attali, Herbert Edelsbrunner