13621 search results - page 238 / 2725 » Computability and Complexity in Self-assembly |
157
Voted
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
179
click to vote
JAIR
2011
15 years 1 months ago
2011
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
179
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
— This paper proposes an efficient blind deterministic carrier frequency offset (CFO) estimation method for orthogonal frequency division multiplexing (OFDM) systems. In the pro...
254
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
In this paper, we tackle the problem of understanding the temporal structure of complex events in highly varying videos obtained from the Internet. Towards this goal, we utilize a...
154
click to vote
VLSID
2007
IEEE
16 years 7 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...