2957 search results - page 144 / 592 » The Complexity of Polynomial-Time Approximation |
149
click to vote
CPM
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
167
click to vote
ICALP
2007
Springer
15 years 11 months 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...
146
Voted
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
139
click to vote
ICPP
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
143
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...