3008 search results - page 209 / 602 » Independence in connected graphs |
166
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
170
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
— Secrecy graphs model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely ...
187
click to vote
ACL
2012
13 years 9 months ago
2012
As one of the most popular micro-blogging services, Twitter attracts millions of users, producing millions of tweets daily. Shared information through this service spreads faster ...
187
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We propose a new penalty function which, when used as regularization for empirical risk minimization procedures, leads to sparse estimators. The support of the sparse vector is ty...
160
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, a colour text/graphics segmentation is proposed. Firstly, it takes advantage of colour properties by computing a relevant hybrid colour model. Then an edge detectio...