2766 search results - page 212 / 554 » Algorithms for trigonometric polynomials |
193
click to vote
ICALP
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
171
click to vote
ICPP
2003
IEEE
15 years 11 months ago
2003
IEEE
Any reliable multicast protocol requires some recovery mechanism. A generic description of a recovery mechanism consists of a prioritized list of recovery servers/receivers (clien...
153
click to vote
CPM
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
171
click to vote
ICALP
1998
Springer
15 years 10 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
169
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...