705 search results - page 60 / 141 » Approximating Extended Answer Sets |
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
STOC
2010
ACM
15 years 1 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
109
click to vote
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
CIKM
2009
Springer
15 years 1 months ago
2009
Springer
Keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases, but current approaches to processing these queries rely...
GRC
2007
IEEE
15 years 4 months ago
2007
IEEE
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on the universe. In the view of granular computing, classica...