425 search results - page 28 / 85 » Polynomial Time Data Reduction for Dominating Set |
ICPR
2008
IEEE
15 years 3 months ago
2008
IEEE
The locally linear embedding (LLE) algorithm is considered as a powerful method for the problem of nonlinear dimensionality reduction. In this paper, first, a new method called cl...
ISMIS
2005
Springer
15 years 3 months ago
2005
Springer
With the rapid advancement of information technology, scalability has become a necessity for learning algorithms to deal with large, real-world data repositories. In this paper, sc...
EPIA
2005
Springer
15 years 3 months ago
2005
Springer
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
APIN
2004
14 years 9 months ago
2004
A rough self-organizing map (RSOM) with fuzzy discretization of feature space is described here. Discernibility reducts obtained using rough set theory are used to extract domain k...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...