Sciweavers

231 search results - page 24 / 47
» On overlays and minimization diagrams
Sort
View
SIGCOMM
2006
ACM
15 years 3 months ago
Minimizing churn in distributed systems
A pervasive requirement of distributed systems is to deal with churn — change in the set of participating nodes due to joins, graceful leaves, and failures. A high churn rate ca...
Brighten Godfrey, Scott Shenker, Ion Stoica
87
Voted
WIA
2000
Springer
15 years 1 months ago
A Package for the Implementation of Block Codes as Finite Automata
We have implemented a package that transforms concise algebraic descriptions of linear block codes into finite automata representations, and also generates decoders from such repre...
Priti Shankar, K. Sasidharan, Vikas Aggarwal, B. S...
TCAD
2008
96views more  TCAD 2008»
14 years 9 months ago
An Implicit Approach to Minimizing Range-Equivalent Circuits
Abstract--Simplifying a combinational circuit while preserving its range has a variety of applications, such as combinational equivalence checking and random simulation. Previous a...
Yung-Chih Chen, Chun-Yao Wang
ER
1999
Springer
105views Database» more  ER 1999»
15 years 1 months ago
Modeling Interactive Web Sources for Information Mediation
We propose a method for modeling complex Web sources that have active user interaction requirements. Here active" refers to the fact that certain information in these sources ...
Bertram Ludäscher, Amarnath Gupta
DIAGRAMS
2008
Springer
14 years 11 months ago
Diagrammatic Logic of Existential Graphs: A Case Study of Commands
Diagrammatic logics have advantages over symbolic cousins. Peirce thought that logical diagrams (Existential Graphs, EG) are capable of "expression of all assertions", as...
Ahti-Veikko Pietarinen