Results 1  10
of
347,246
The Asymptotic Complexity of Merging Networks
 In Proc. 33rd IEEEFOCS
, 1992
"... Let M (m; n) be the minimum number of comparators needed in a comparator network that merges m elements x 1 x 2 : : : xm and n elements y 1 y 2 : : : y n , where n m. Batcher's oddeven merge yields the following upper bound: M (m; n) 1 2 (m + n) log 2 m +O(n); in particular, M (n; n ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Let M (m; n) be the minimum number of comparators needed in a comparator network that merges m elements x 1 x 2 : : : xm and n elements y 1 y 2 : : : y n , where n m. Batcher's oddeven merge yields the following upper bound: M (m; n) 1 2 (m + n) log 2 m +O(n); in particular, M (n
The Asymptotic Complexity of Merging Networks (Extended Abstract)
, 1995
"... ) Peter Bro Miltersen y Mike Paterson z Jun Tarui z January 16, 1995 Abstract Let M (m; n) be the minimum number of comparators in a comparator network that merges two ordered chains x 1 x 2 : : : xm and y 1 y 2 : : : yn , where n m. Batcher's oddeven merge yields the following up ..."
Abstract
 Add to MetaCart
bound asymptotically: M (m; n) 1 2 (m + n) log 2 (m + 1) \Gamma O(m); e.g., M (n; n) n log 2 n \Gamma O(n): Our proof technique extends to give similarly tight lower bounds for the size of monotone Boolean circuits for merging, and for the size of switching networks capable of realizing the set
Statistical mechanics of complex networks
 Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract

Cited by 2083 (10 self)
 Add to MetaCart
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs
Sorting networks and their applications
, 1968
"... To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing ..."
Abstract

Cited by 660 (0 self)
 Add to MetaCart
To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing
Routing Techniques in Wireless Sensor Networks: A Survey
 IEEE Wireless Communications
, 2004
"... Wireless Sensor Networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. The focus, howeve ..."
Abstract

Cited by 704 (2 self)
 Add to MetaCart
Wireless Sensor Networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. The focus
Network information flow
 IEEE TRANS. INFORM. THEORY
, 2000
"... We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information source ..."
Abstract

Cited by 1961 (24 self)
 Add to MetaCart
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information
Bayesian Network Classifiers
, 1997
"... Recent work in supervised learning has shown that a surprisingly simple Bayesian classifier with strong assumptions of independence among features, called naive Bayes, is competitive with stateoftheart classifiers such as C4.5. This fact raises the question of whether a classifier with less restr ..."
Abstract

Cited by 788 (23 self)
 Add to MetaCart
restrictive assumptions can perform even better. In this paper we evaluate approaches for inducing classifiers from data, based on the theory of learning Bayesian networks. These networks are factored representations of probability distributions that generalize the naive Bayesian classifier and explicitly
Statecharts: A Visual Formalism For Complex Systems
, 1987
"... We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discreteevent systems, such as multicomputer realtime systems, communication protocols and digital control units. Our diagrams, which we cal ..."
Abstract

Cited by 2683 (56 self)
 Add to MetaCart
We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discreteevent systems, such as multicomputer realtime systems, communication protocols and digital control units. Our diagrams, which we
Results 1  10
of
347,246