Sublinear time width-bounded separators and their application to the protein side-chain packing problem

Given d >2 and a set of n grid points Q in ℜ d , we design a randomized algorithm that finds a w -wide separator, which is determined by a hyper-plane, in sublinear time such that Q has at most points on either side of the hyper-plane, and at most points within distance to the hyper-plane, where...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of combinatorial optimization Ročník 15; číslo 4; s. 387 - 407
Hlavní autori:	Fu, Bin, Chen, Zhixiang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.05.2008 Springer
Predmet:	Applied sciences Combinatorics Convex and Discrete Geometry Exact sciences and technology Flows in networks. Combinatorial problems Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operational research and scientific management Operational research. Management science Operations Research/Decision Theory Optimization Probability and statistics Sampling theory, sample surveys Sciences and techniques of general use Statistics Theory of Computation Sublinear time algorithm Random sampling Width-bounded separator Randomized design Grid Bin packing problem Molecular biology Combinatorial optimization Bioinformatics Separator
ISSN:	1382-6905, 1573-2886
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!