4860 search results - page 124 / 972 » SNPs Problems, Complexity, and Algorithms |
119
click to vote
CIAC
2010
Springer
16 years 10 days ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
120
click to vote
CASC
2009
Springer
15 years 9 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
147
click to vote
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— A geometric optimization based approach to deploy a mobile sensor network for the purpose of detecting and capturing mobile targets in the plane is presented in [1]. Th...
127
click to vote
IJCGA
2006
15 years 3 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
125
click to vote
COCO
2009
Springer
15 years 9 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...