2766 search results - page 325 / 554 » Algorithms for trigonometric polynomials |
216
click to vote
PDCAT
2005
Springer
16 years 2 days ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
194
click to vote
STACS
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
173
click to vote
VLDB
2005
ACM
16 years 2 days ago
2005
ACM
When a private relational table is published using views, secrecy or privacy may be violated. This paper uses a formally-defined notion of k-anonymity to measure disclosure by vi...
166
Voted
WABI
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...
140
click to vote
CPAIOR
2004
Springer
15 years 12 months ago
2004
Springer
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...