1998 search results - page 320 / 400 » Complexity of the Cover Polynomial |
120
Voted
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
115
Voted
RTSS
2007
IEEE
15 years 7 months ago
2007
IEEE
Many distributed real-time systems face the challenge of dynamically maximizing system utility and meeting stringent resource constraints in response to fluctuations in system wo...
COCO
2007
Springer
15 years 6 months ago
2007
Springer
The NP machine hypothesis posits the existence of an ǫ > 0 and a nondeterministic polynomial-time Turing machine M which accepts the language 0∗ but for which no determinist...
115
Voted
COLT
2007
Springer
15 years 6 months ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
109
Voted
CSCLP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...