1503 search results - page 133 / 301 » Detecting Anomalies in Graphs |
152
click to vote
ACSW
2006
15 years 6 months ago
2006
Computational grids are now widespread, but their large-scale behaviour is still poorly understood. We report on some calculations of loading, scaling and utilisation behaviours o...
144
click to vote
DAGSTUHL
2003
15 years 6 months ago
2003
One way to visualize large time-dependent data sets, is by visualization of the evolution of features in these data. The process consists of four steps: feature extraction, featur...
119
click to vote
DAGSTUHL
2006
15 years 6 months ago
2006
It is known that, for every constant k 3, the presence of a k-clique (a complete subgraph on k vertices) in an n-vertex graph cannot be detected by a monotone boolean circuit usi...
136
click to vote
ESANN
2001
15 years 6 months ago
2001
Abstract. An approach to symbolic contour extraction will be described that consists of three stages: enhancement, detection, and extraction of edges and corners. Edges and corners...
136
click to vote
ISSS
1998
IEEE
15 years 9 months ago
1998
IEEE
Complex system specifications are often hierarchically composed of several subsystems. Each subsystem contains one or more processes. In order to provide optimization across diffe...