Sciweavers

1986 search results - page 309 / 398
» Path Separability of Graphs
Sort
View
PADS
2005
ACM
14 years 2 months ago
Simulating Realistic Packet Routing without Routing Protocols
A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decis...
George F. Riley, Dheeraj Reddy
DAS
2010
Springer
14 years 9 days ago
Handwritten Arabic text line segmentation using affinity propagation
In this paper, we present a novel graph-based method for extracting handwritten text lines in monochromatic Arabic document images. Our approach consists of two steps Coarse text ...
Jayant Kumar, Wael Abd-Almageed, Le Kang, David S....
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 9 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud
CORR
2004
Springer
124views Education» more  CORR 2004»
13 years 8 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
SIGSOFT
2010
ACM
13 years 3 months ago
Path-based fault correlations
Although a number of automatic tools have been developed to detect faults, much of the diagnosis is still being done manually. To help with the diagnostic tasks, we formally intro...
Wei Le, Mary Lou Soffa