2766 search results - page 472 / 554 » Algorithms for trigonometric polynomials |
137
Voted
ICALP
1999
Springer
15 years 8 months ago
1999
Springer
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and seve...
133
Voted
ICIAP
1999
ACM
15 years 8 months ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
105
click to vote
STACS
1998
Springer
15 years 8 months ago
1998
Springer
We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1-decis...
143
Voted
PODS
1997
ACM
15 years 8 months ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
209
Voted
FOCS
1993
IEEE
15 years 7 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...