1301 search results - page 125 / 261 » Bounded Version Vectors |
106
Voted
RECOMB
2006
Springer
16 years 1 months ago
2006
Springer
Meiotic recombination is a fundamental biological event and one of the principal evolutionary forces responsible for shaping genetic variation within species. In addition to its fu...
113
Voted
STOC
2006
ACM
16 years 1 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
98
Voted
COCO
2009
Springer
15 years 7 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
118
Voted
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
112
click to vote
ISPD
2004
ACM
15 years 6 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...