2520 search results - page 256 / 504 » The complexity of approximating entropy |
171
click to vote
VTC
2007
IEEE
16 years 26 days ago
2007
IEEE
— This letter proposes a simple but highly efficient technique to jointly utilize space, time, and polarization diversities. The technique is based on extending orthogonal space-...
174
click to vote
ICMCS
2006
IEEE
16 years 19 days ago
2006
IEEE
Multi-reference frame motion estimation improves the accuracy of motion compensation in video compression, but it also dramatically increases computational complexity. Based on tr...
173
click to vote
COMPGEOM
2006
ACM
16 years 17 days ago
2006
ACM
It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides,...
175
click to vote
STOC
2006
ACM
16 years 17 days ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
170
click to vote
ICRA
2005
IEEE
16 years 6 days ago
2005
IEEE
Abstract— We present a novel algorithm for motion planning of a deformable robot in a static environment. Given the initial and final configuration of the robot, our algorithm ...