2569 search results - page 31 / 514 » Approximate Objects and Approximate Theories |
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
105
click to vote
RSCTC
2004
Springer
15 years 5 months ago
2004
Springer
The combination of fuzzy set and rough set theories lead to various models. Functional and set approaches are two categories based on different fuzzy representations. In this pape...
100
click to vote
IJAR
2008
14 years 11 months ago
2008
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize pa...
DEXA
2004
Springer
15 years 5 months ago
2004
Springer
We present a framework for representing the trajectories of moving objects and the time-varying results of operations on moving objects. This framework supports the realization of ...
104
click to vote
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...