406 search results - page 50 / 82 » Pseudorandomness and Combinatorial Constructions |
ESA
2007
Springer
14 years 5 months ago
2007
Springer
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
BMCBI
2006
13 years 11 months ago
2006
Background: In binary high-throughput screening projects where the goal is the identification of low-frequency events, beyond the obvious issue of efficiency, false positives and ...
STOC
2004
ACM
14 years 11 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
EUROCAST
2009
Springer
14 years 5 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
EVOW
2007
Springer
14 years 5 months ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...