• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 22,733
Next 10 →

Direct link

by unknown authors
"... interconnect, LUT chain, and register chain connection lines. The local interconnect transfers signals between LEs in the same LAB. LUT chain connections transfer the output of one LE’s LUT to the adjacent LE for fast sequential LUT connections within the same LAB. Register chain connections transfe ..."
Abstract - Add to MetaCart
interconnect, LUT chain, and register chain connection lines. The local interconnect transfers signals between LEs in the same LAB. LUT chain connections transfer the output of one LE’s LUT to the adjacent LE for fast sequential LUT connections within the same LAB. Register chain connections transfer the output of one LE’s register to the adjacent LE’s register within an LAB. The Quartus ® II Compiler places associated logic within an LAB or adjacent LABs, allowing the use of local, LUT chain, and register chain connections for performance and area efficiency. Figure 4–1 shows the Stratix ® GX LAB.

The link-prediction problem for social networks

by David Liben-nowell, Jon Kleinberg - J. AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY , 2007
"... Given a snapshot of a social network, can we infer which new interactions among its members are likely to occur in the near future? We formalize this question as the link-prediction problem, and we develop approaches to link prediction based on measures for analyzing the “proximity” of nodes in a ne ..."
Abstract - Cited by 906 (6 self) - Add to MetaCart
Given a snapshot of a social network, can we infer which new interactions among its members are likely to occur in the near future? We formalize this question as the link-prediction problem, and we develop approaches to link prediction based on measures for analyzing the “proximity” of nodes in a

Goal-directed Requirements Acquisition

by Anne Dardenne , Axel van Lamsweerde, Stephen Fickas - SCIENCE OF COMPUTER PROGRAMMING , 1993
"... Requirements analysis includes a preliminary acquisition step where a global model for the specification of the system and its environment is elaborated. This model, called requirements model, involves concepts that are currently not supported by existing formal specification languages, such as goal ..."
Abstract - Cited by 585 (17 self) - Add to MetaCart
where each node captures an abstraction such as, e.g., goal, action, agent, entity, or event, and where the edges capture semantic links between such abstractions. Well-formedness properties on nodes and links constrain their instances - that is, elements of requirements models. Requirements acquisition

Uni-Directional Links in Routing

by Karina Gribanova , 2004
"... A number of network configurations, in which pairs of nodes are connected by uni-directional links (UDLs), is increasing. For the QoS related reasons, it may be also advantageous to assume that a bi-directional link (BDL) is a set of two unidirectional links. Current routing protocols are designed f ..."
Abstract - Add to MetaCart
A number of network configurations, in which pairs of nodes are connected by uni-directional links (UDLs), is increasing. For the QoS related reasons, it may be also advantageous to assume that a bi-directional link (BDL) is a set of two unidirectional links. Current routing protocols are designed

The Contourlet Transform: An Efficient Directional Multiresolution Image Representation

by Minh N. Do, Martin Vetterli - IEEE TRANSACTIONS ON IMAGE PROCESSING
"... The limitations of commonly used separable extensions of one-dimensional transforms, such as the Fourier and wavelet transforms, in capturing the geometry of image edges are well known. In this paper, we pursue a “true” two-dimensional transform that can capture the intrinsic geometrical structure t ..."
Abstract - Cited by 513 (20 self) - Add to MetaCart
link between the developed filter bank and the associated continuousdomain contourlet expansion via a directional multiresolution analysis framework. We show that with parabolic scaling and sufficient directional vanishing moments, contourlets achieve the optimal approximation rate for piecewise smooth

A High-Throughput Path Metric for Multi-Hop Wireless Routing

by Douglas S. J. De Couto, Daniel Aguayo, John Bicket, Robert Morris , 2003
"... This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The E ..."
Abstract - Cited by 1108 (5 self) - Add to MetaCart
. The ETX metric incorporates the effects of link loss ratios, asymmetry in the loss ratios between the two directions of each link, and interference among the successive links of a path. In contrast, the minimum hop-count metric chooses arbitrarily among the different paths of the same minimum length

A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

by Vincent D. Park, M. Scott Corson , 1997
"... We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms. The protocol's reaction is structured as a temporally-ordered sequence of diffusing computations; each computat ..."
Abstract - Cited by 1100 (6 self) - Add to MetaCart
computation consisting of a sequence of directed l i nk reversals. The protocol is highly adaptive, efficient and scalable; being best-suited for use in large, dense, mobile networks. In these networks, the protocol's reaction to link failures typically involves only a localized "single pass

Tapestry: An infrastructure for fault-tolerant wide-area location and routing

by Ben Y. Zhao, John Kubiatowicz, Anthony D. Joseph , 2001
"... In today’s chaotic network, data and services are mobile and replicated widely for availability, durability, and locality. Components within this infrastructure interact in rich and complex ways, greatly stressing traditional approaches to name service and routing. This paper explores an alternative ..."
Abstract - Cited by 1250 (31 self) - Add to MetaCart
an alternative to traditional approaches called Tapestry. Tapestry is an overlay location and routing infrastructure that provides location-independent routing of messages directly to the closest copy of an object or service using only point-to-point links and without centralized resources. The routing

Probabilistic Outputs for Support Vector Machines and Comparisons to Regularized Likelihood Methods

by John C. Platt - ADVANCES IN LARGE MARGIN CLASSIFIERS , 1999
"... The output of a classifier should be a calibrated posterior probability to enable post-processing. Standard SVMs do not provide such probabilities. One method to create probabilities is to directly train a kernel classifier with a logit link function and a regularized maximum likelihood score. Howev ..."
Abstract - Cited by 1051 (0 self) - Add to MetaCart
The output of a classifier should be a calibrated posterior probability to enable post-processing. Standard SVMs do not provide such probabilities. One method to create probabilities is to directly train a kernel classifier with a logit link function and a regularized maximum likelihood score

Consensus and cooperation in networked multi-agent systems

by Reza Olfati-Saber , J Alex Fax , Richard M Murray , Reza Olfati-Saber , J Alex Fax , Richard M Murray - Proceedings of the IEEE , 2007
"... Summary. This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees. An ove ..."
Abstract - Cited by 807 (4 self) - Add to MetaCart
Summary. This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees
Next 10 →
Results 1 - 10 of 22,733
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University