9532 search results - page 366 / 1907 » Logic, Graphs, and Algorithms |
223
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
182
click to vote
ECAI
1992
Springer
15 years 10 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
160
click to vote
RSCTC
2000
Springer
15 years 10 months ago
2000
Springer
Feature selection is used to improve performance of learning algorithms by finding a minimal subset of relevant features. Since the process of feature selection is computationally ...
182
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
190
click to vote
MICAI
2007
Springer
16 years 27 days ago
2007
Springer
Among various document clustering algorithms that have been proposed so far, the most useful are those that automatically reveal the number of clusters and assign each target docum...