2310 search results - page 179 / 462 » Coloring Random Graphs |
127
Voted
WDAG
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
109
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
120
click to vote
FCT
2009
Springer
15 years 9 months ago
2009
Springer
Despite of their applicability betweennness constraints have (to the author’s knowledge) hardly been considered from the random structures point of view. They are essentially di�...
159
Voted
ICCV
2003
IEEE
16 years 4 months ago
2003
IEEE
This paper describes a novel application of support vector machines and multiscale texture and color invariants to a problem in biological oceanography: the identification of 6 sp...
110
Voted
SIGGRAPH
2010
ACM
15 years 7 months ago
2010
ACM
In this paper, we introduce a compact random-access vector representation for solid textures made of intermixed regions with relatively smooth internal color variations. It is fea...