817 search results - page 90 / 164 » On 2-factors with k components |
165
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
153
click to vote
WWW
2003
ACM
16 years 6 months ago
2003
ACM
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
141
click to vote
COCOON
2007
Springer
16 years 11 days ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
196
click to vote
ICETET
2009
IEEE
15 years 3 months ago
2009
IEEE
With increasing concern about energy shortage and environmental protection, research on reducing exhaust emissions, reducing fuel consumption, reducing engine noise and increasing...
173
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Gaussian mean-shift (GMS) is a clustering algorithm that has been shown to produce good image segmentations (where each pixel is represented as a feature vector with spatial and r...