Sciweavers

760 search results - page 98 / 152
» Algorithms for finding clique-transversals of graphs
Sort
View
COMCOM
2006
154views more  COMCOM 2006»
13 years 8 months ago
Minimum-cost network hardening using attack graphs
In defending one's network against cyber attack, certain vulnerabilities may seem acceptable risks when considered in isolation. But an intruder can often infiltrate a seemin...
Lingyu Wang, Steven Noel, Sushil Jajodia
SIGKDD
2008
125views more  SIGKDD 2008»
13 years 8 months ago
Incremental pattern discovery on streams, graphs and tensors
Incremental pattern discovery targets streaming applications where the data continuously arrive incrementally. The questions are how to find patterns (main trends) incrementally; ...
Jimeng Sun
ANOR
2004
170views more  ANOR 2004»
13 years 8 months ago
Graph Coloring for Air Traffic Flow Management
The aim of Air Traffic Flow Management (ATFM) is to enhance the capacity of the airspace while satisfying Air Traffic Control constraints and airlines requests to optimize their o...
Nicolas Barnier, Pascal Brisset
ICDM
2006
IEEE
166views Data Mining» more  ICDM 2006»
14 years 2 months ago
Mining Generalized Graph Patterns Based on User Examples
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...
Pavel Dmitriev, Carl Lagoze
PPOPP
2006
ACM
14 years 2 months ago
On-line automated performance diagnosis on thousands of processes
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
Philip C. Roth, Barton P. Miller