2957 search results - page 323 / 592 » The Complexity of Polynomial-Time Approximation |
187
click to vote
DIS
2004
Springer
16 years 9 hour ago
2004
Springer
Abstract. In this paper, we consider 0/1 databases and provide an alternative way of extracting knowledge from such databases using tiles. A tile is a region in the database consis...
159
click to vote
LICS
2003
IEEE
15 years 12 months ago
2003
IEEE
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
163
click to vote
GBRPR
2009
Springer
15 years 11 months ago
2009
Springer
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
219
click to vote
INFOCOM
2000
IEEE
15 years 11 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 ...
167
click to vote
ISSAC
1995
Springer
15 years 10 months ago
1995
Springer
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...