4009 search results - page 366 / 802 » Clustering on Complex Graphs |
207
click to vote
DBSEC
2009
15 years 8 months ago
2009
Abstract. Identifying and protecting the trusted computing base (TCB) of a system is an important task, which is typically performed by designing and enforcing a system security po...
154
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
177
click to vote
IJWGS
2006
15 years 6 months ago
2006
: This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representation...
175
click to vote
IPL
2010
15 years 5 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
194
click to vote
MCS
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...