Sciweavers

1039 search results - page 125 / 208
» Kernels and Regularization on Graphs
Sort
View
JGAA
2007
142views more  JGAA 2007»
15 years 3 months ago
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
Kerri Morgan, Graham Farr
JLP
2006
81views more  JLP 2006»
15 years 3 months ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter
ICMCS
2008
IEEE
120views Multimedia» more  ICMCS 2008»
15 years 10 months ago
Using Semantic Graphs for Image Search
In this paper, we propose a Semantic Graphs for Image Search (SGIS) system, which provides a novel way for image search by utilizing collaborative knowledge in Wikipedia and netwo...
Jyh-Ren Shieh, Yang-Ting Yeh, Chih-Hung Lin, Ching...
JNSM
2008
93views more  JNSM 2008»
15 years 3 months ago
Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
Steven Noel, Sushil Jajodia
JGAA
2007
135views more  JGAA 2007»
15 years 3 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento