Sciweavers

142 search results - page 21 / 29
» Generalizing Graphs Using Amalgamation and Selection
Sort
View
100
Voted
SSS
2007
Springer
130views Control Systems» more  SSS 2007»
15 years 5 months ago
Decentralized Detector Generation in Cooperative Intrusion Detection Systems
We consider Cooperative Intrusion Detection System (CIDS) which is a distributed AIS-based (Artificial Immune System) IDS where nodes collaborate over a peer-to-peer overlay netwo...
Rainer Bye, Katja Luther, Seyit Ahmet Çamte...
86
Voted
WWW
2005
ACM
16 years 9 days ago
G-ToPSS: fast filtering of graph-based metadata
RDF is increasingly being used to represent metadata. RDF Site Summary (RSS) is an application of RDF on the Web that has considerably grown in popularity. However, the way RSS sy...
Milenko Petrovic, Haifeng Liu, Hans-Arno Jacobsen
CIVR
2008
Springer
279views Image Analysis» more  CIVR 2008»
15 years 1 months ago
Semi-supervised learning of object categories from paired local features
This paper presents a semi-supervised learning (SSL) approach to find similarities of images using statistics of local matches. SSL algorithms are well known for leveraging a larg...
Wen Wu, Jie Yang
ICDAR
2005
IEEE
15 years 5 months ago
A Novel Approach to Recover Writing Order From Single Stroke Offline Handwritten Images
Problem of recovering a writing order from singlestroked handwritten image can be seen as finding the smoothest Euler path in its graph representation. In this paper, a novel appr...
Yu Qiao, Makoto Yasuhara
CORR
2010
Springer
107views Education» more  CORR 2010»
14 years 10 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase