1998 search results - page 247 / 400 » Complexity of the Cover Polynomial |
134
Voted
RANDOM
2001
Springer
15 years 5 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
130
Voted
INFOCOM
2000
IEEE
15 years 5 months ago
2000
IEEE
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
CPM
2000
Springer
15 years 5 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
ISSS
1999
IEEE
15 years 5 months ago
1999
IEEE
Portable or embedded systems allow more and more complex applications like multimedia today. These applications and submicronic technologies have made the power consumption criter...
110
Voted
ESA
1999
Springer
15 years 5 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...