Results 1  10
of
482,031
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in LookupTable Based FPGA Designs
 IEEE TRANS. CAD
, 1994
"... The field programmable gatearray (FPGA) has become an important technology in VLSI ASIC designs. In the past a few years, a number of heuristic algorithms have been proposed for technology mapping in lookuptable (LUT) based FPGA designs, but none of them guarantees optimal solutions for general Bo ..."
Abstract

Cited by 317 (41 self)
 Add to MetaCart
The field programmable gatearray (FPGA) has become an important technology in VLSI ASIC designs. In the past a few years, a number of heuristic algorithms have been proposed for technology mapping in lookuptable (LUT) based FPGA designs, but none of them guarantees optimal solutions for general Boolean networks and little is known about how far their solutions are away from the optimal ones. This paper presents a theoretical breakthrough which shows that the LUTbased FPGA technology mapping problem for depth minimization can be solved optimally in polynomial time. A key step in our algorithm is to compute a minimum height Kfeasible cut in a network, which is solved optimally in polynomial time based on network flow computation. Our algorithm also effectively minimizes the number of LUTs by maximizing the volume of each cut and by several postprocessing operations. Based on these results, we have implemented an LUTbased FPGA mapping package called FlowMap. We have tested FlowMap on a large set of benchmark examples and compared it with other LUTbased FPGA mapping algorithms for delay optimization, including Chortled, MISpgadelay, and DAGMap. FlowMap reduces the LUT network depth by up to 7% and reduces the number of LUTs by up to 50% compared to the three previous methods.
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technologies. The CCRP pursues a broad program of research and analysis in information superiority, information operations, command and control theory, and associated operational concepts that enable us to leverage shared awareness to improve the effectiveness and efficiency of assigned missions. An important aspect of the CCRP program is its ability to serve as a bridge between the operational, technical, analytical, and educational communities. The CCRP provides leadership for the command and control research community by: n n
The MilnorChow homomorphism revisited
 KTHEORY
, 2007
"... The aim of this note is to give a simplified proof of the surjectivity of the natural Milnor–Chow homomorphism ρ: K M n (A) → CHn (A, n) between Milnor K–theory and higher Chow groups for essentially smooth (semi–)local k–algebras A with k infinite. It implies the exactness of the Gersten resoluti ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
The aim of this note is to give a simplified proof of the surjectivity of the natural Milnor–Chow homomorphism ρ: K M n (A) → CHn (A, n) between Milnor K–theory and higher Chow groups for essentially smooth (semi–)local k–algebras A with k infinite. It implies the exactness of the Gersten
Graph homomorphism revisited for graph matching
 PVLDB
"... In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing the structural similarity in these applicatio ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing the structural similarity
Graph homomorphisms
, 2006
"... This is a brief introduction to graph homomorphisms, hopefully a prelude to a study of the paper [1]. 1 Homomorphisms A homomorphism from a graph G to a graph H is a map from V G to V H which takes edges to edges. (It may map a nonedge to a single vertex, a nonedge, or an edge.) Homomorphisms are a ..."
Abstract
 Add to MetaCart
This is a brief introduction to graph homomorphisms, hopefully a prelude to a study of the paper [1]. 1 Homomorphisms A homomorphism from a graph G to a graph H is a map from V G to V H which takes edges to edges. (It may map a nonedge to a single vertex, a nonedge, or an edge.) Homomorphisms are a
Regular Graphs With No Homomorphisms Onto Cycles
 J. Combin. Theory Ser. B
, 2001
"... INTRODUCTION A homomorphism from a graph G to a graph H is a mapping of the vertices of G into the vertices of H which sends each edge of G to an edge in H . It is not known if there exists a cubic (3regular) graph with arbitrarily large girth and with no homomorphism onto the cycle C 5 . Note tha ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
INTRODUCTION A homomorphism from a graph G to a graph H is a mapping of the vertices of G into the vertices of H which sends each edge of G to an edge in H . It is not known if there exists a cubic (3regular) graph with arbitrarily large girth and with no homomorphism onto the cycle C 5 . Note
Graph Homomorphisms and Long Range Actions
, 2001
"... We show that if a graph H is kcolorable, then (k−1)branching walks on H exhibit long range action, in the sense that the position of a token at time 0 constrains the configuration of its descendents arbitrarily far into the future. This long range action property is one of several investigated her ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
herein; all are similar in some respects to chromatic number but based on viewing H as the range, instead of the domain, of a graph homomorphism. The properties are based on combinatorial forms of probabilistic concepts from statistical physics, although we argue that they are natural even in a purely
ROC graphs: Notes and practical considerations for data mining researchers
, 2003
"... Receiver Operating Characteristics (ROC) graphs are a useful technique for organizing classifiers and visualizing their performance. ROC graphs are commonly used in medical decision making, and in recent years have been increasingly adopted in the machine learning and data mining research communitie ..."
Abstract

Cited by 205 (0 self)
 Add to MetaCart
Receiver Operating Characteristics (ROC) graphs are a useful technique for organizing classifiers and visualizing their performance. ROC graphs are commonly used in medical decision making, and in recent years have been increasingly adopted in the machine learning and data mining research
Results 1  10
of
482,031