Sciweavers

553 search results - page 90 / 111
» Cover Contact Graphs
Sort
View
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
15 years 3 months ago
Linear Time Algorithms for Generalized Edge Dominating Set Problems
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
André Berger, Ojas Parekh
77
Voted
ACSD
1998
IEEE
121views Hardware» more  ACSD 1998»
15 years 2 months ago
Identifying State Coding Conflicts in Asynchronous System Specifications Using Petri Net Unfoldings
State coding conflict detection is a fundamental part of synthesis of asynchronous concurrent systems from their specifications as Signal Transition Graphs (STGs), which are a spe...
Alex Kondratyev, Jordi Cortadella, Michael Kishine...
FOCS
1993
IEEE
15 years 2 months ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch
DAS
2010
Springer
15 years 2 months ago
A post-processing scheme for malayalam using statistical sub-character language models
Most of the Indian scripts do not have any robust commercial OCRs. Many of the laboratory prototypes report reasonable results at recognition/classification stage. However, word ...
Karthika Mohan, C. V. Jawahar
99
Voted
GLOBECOM
2007
IEEE
15 years 4 months ago
Loss Tomography in General Topologies with Network Coding
Abstract— Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general...
Minas Gjoka, Christina Fragouli, Pegah Sattari, At...