1158 search results - page 100 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
148
Voted
MOC
2000
15 years 6 months ago
2000
A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorit...
187
click to vote
IAT
2009
IEEE
16 years 27 days ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
194
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
266
click to vote
GECCO
2007
Springer
16 years 9 days ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
160
click to vote
IWPEC
2009
Springer
16 years 21 days ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...