1998 search results - page 177 / 400 » Complexity of the Cover Polynomial |
169
click to vote
PVLDB
2008
15 years 6 months ago
2008
The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold...
161
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— In this note, we present initial results towards developing a distributed algorithm for repairing topological holes in the sensor cover of a mobile robot team. Central to our a...
147
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
150
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ...
164
click to vote
ISCC
2008
IEEE
16 years 28 days ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...