Sciweavers

5606 search results - page 427 / 1122
» Randomization Techniques for Graphs.
Sort
View
ALENEX
2007
102views Algorithms» more  ALENEX 2007»
15 years 8 months ago
Linearization: Locally Self-Stabilizing Sorting in Graphs
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
Melih Onus, Andréa W. Richa, Christian Sche...
RTS
2006
176views more  RTS 2006»
15 years 6 months ago
Verifying distributed real-time properties of embedded systems via graph transformations and model checking
Component middleware provides dependable and efficient platforms that support key functional, and quality of service (QoS) needs of distributed real-time embedded (DRE) systems. C...
Gabor Madl, Sherif Abdelwahed, Douglas C. Schmidt
USS
2010
15 years 4 months ago
BotGrep: Finding P2P Bots with Structured Graph Analysis
A key feature that distinguishes modern botnets from earlier counterparts is their increasing use of structured overlay topologies. This lets them carry out sophisticated coordina...
Shishir Nagaraja, Prateek Mittal, Chi-Yao Hong, Ma...
KDD
2009
ACM
200views Data Mining» more  KDD 2009»
16 years 1 months ago
Visual analysis of documents with semantic graphs
In this paper, we present a technique for visual analysis of documents based on the semantic representation of text in the form of a directed graph, referred to as semantic graph....
Delia Rusu, Blaz Fortuna, Dunja Mladenic, Marko Gr...
MICCAI
2001
Springer
15 years 11 months ago
Segmentation of Dynamic N-D Data Sets via Graph Cuts Using Markov Models
Abstract. This paper describes a new segmentation technique for multidimensional dynamic data. One example of such data is a perfusion sequence where a number of 3D MRI volumes sho...
Yuri Boykov, Vivian S. Lee, Henry Rusinek, Ravi Ba...