2766 search results - page 215 / 554 » Algorithms for trigonometric polynomials |
165
click to vote
ECAI
2010
Springer
15 years 3 months ago
2010
Springer
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
114
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
135
click to vote
CASC
2007
Springer
15 years 11 months ago
2007
Springer
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
125
click to vote
SAC
2006
ACM
15 years 10 months ago
2006
ACM
Several different techniques and softwares intend to improve the accuracy of results computed in a fixed finite precision. Here we focus on a method to improve the accuracy of ...
145
click to vote
COCO
2005
Springer
15 years 10 months ago
2005
Springer
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of ...