2877 search results - page 381 / 576 » The Complexity of Planarity Testing |
127
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
132
click to vote
ISSTA
2009
ACM
15 years 11 months ago
2009
ACM
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
149
click to vote
BMEI
2008
IEEE
15 years 11 months ago
2008
IEEE
Multiple sequence alignment is the most fundamental task in bioinformatics and computational biology. In this paper, we present a new algorithm to conduct multiple sequences align...
163
click to vote
CEC
2008
IEEE
15 years 11 months ago
2008
IEEE
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
140
click to vote
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
— In this paper, we study the problem of distributed detection in the presence of unknown carrier frequency offset (CFO) and initial phase, the issue we encounter in the emerging...