Sciweavers

314 search results - page 35 / 63
» connection 1998
Sort
View
SIAMCOMP
1998
168views more  SIAMCOMP 1998»
13 years 8 months ago
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
Maw-Shang Chang
SOFTWARE
1998
13 years 8 months ago
Real-Life Object-Oriented Systems
Object-oriented development is expected to provide many benefits, but observations of industrial practice show that there are many problems to overcome. This paper discusses two i...
Søren Lauesen
TC
1998
13 years 8 months ago
Resilient Authentication Using Path Independence
—Authentication using a path of trusted intermediaries, each able to authenticate the next in the path, is a well-known technique for authenticating channels in a large distribut...
Michael K. Reiter, Stuart G. Stubblebine
TCS
1998
13 years 8 months ago
Algebraic Translations, Correctness and Algebraic Compiler Construction
Algebraic translation methods are argued for in many fields of science. Several examples will be considered: from the field of compiler construction, database updates, concurren...
Theo M. V. Janssen
TCS
1998
13 years 8 months ago
Conflict-Free Channel Set Assignment for an Optical Cluster Interconnection Network Based on Rotator Digraphs
Recently a class of scalable multi-star optical networks is proposed in [2]. In this class of networks nodes are grouped into clusters. Each cluster employs a separate pair of bro...
Peng-Jun Wan