Results 1  10
of
294,827
Mixed Interpolation Methods With Arbitrary Nodes
, 1998
"... Previous work on interpolation by linear combinations of the form aC(x) + bS(x) + P n 2 i=0 i x i , where C and S are given functions and the coecients a, b, and f i g are determined by the interpolation conditions, was restricted to uniformly spaced interpolation nodes. Here we derive both N ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Previous work on interpolation by linear combinations of the form aC(x) + bS(x) + P n 2 i=0 i x i , where C and S are given functions and the coecients a, b, and f i g are determined by the interpolation conditions, was restricted to uniformly spaced interpolation nodes. Here we derive both
On a mixed interpolation with integral conditions at arbitrary nodes
, 2016
"... Abstract: In this paper, we present a symbolic algorithm for a mixed interpolation of the form where k > 0 is a given parameter and the coefficients a, b, and c 0 , … , c s−2 are determined by a given set of independent integral conditions at arbitrary nodes. Implementation of the proposed algor ..."
Abstract
 Add to MetaCart
Abstract: In this paper, we present a symbolic algorithm for a mixed interpolation of the form where k > 0 is a given parameter and the coefficients a, b, and c 0 , … , c s−2 are determined by a given set of independent integral conditions at arbitrary nodes. Implementation of the proposed
Performance analysis of R*trees with arbitrary node extents
 Tran. Knowl. Data Eng. (TKDE
, 2004
"... Abstract—Existing analysis for Rtrees is inadequate for several traditional and emerging applications including, for example, temporal, spatiotemporal, and multimedia databases because it is based on the assumption that the extents of a node are identical on all dimensions, which is not satisfied ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract—Existing analysis for Rtrees is inadequate for several traditional and emerging applications including, for example, temporal, spatiotemporal, and multimedia databases because it is based on the assumption that the extents of a node are identical on all dimensions, which is not satisfied
No Fuzzy Creep! A Clustering Algorithm for Controlling Arbitrary Node Movement
"... A perennial problem in vector overlay is fuzzy creep. Commercial vector overlay algorithms resolve near intersections of lines employing arbitrary node movement to align two chains at nodes selected randomly in the area of an epsilon band. While this solution is effective in reducing the number of s ..."
Abstract
 Add to MetaCart
A perennial problem in vector overlay is fuzzy creep. Commercial vector overlay algorithms resolve near intersections of lines employing arbitrary node movement to align two chains at nodes selected randomly in the area of an epsilon band. While this solution is effective in reducing the number
A generalized processor sharing approach to flow control in integrated services networks: The singlenode case
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1993
"... The problem of allocating network resources to the users of an integrated services network is investigated in the context of ratebased flow control. The network is assumed to be a virtual circuit, connectionbased packet network. We show that the use of Generalized processor Sharing (GPS), when co ..."
Abstract

Cited by 2011 (5 self)
 Add to MetaCart
, the performance of a singleserver GPS system is analyzed exactly from the standpoint of worstcase packet delay and burstiness when the sources are constrained by leaky buckets. The worstcase session backlogs are also determined. In the sequel to this paper, these results are extended to arbitrary topology
DSR: The Dynamic Source Routing Protocol for MultiHop Wireless Ad Hoc Networks
 In Ad Hoc Networking, edited by Charles E. Perkins, Chapter 5
, 2001
"... The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multihop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely selforganizing and selfconfiguring, without the need for any existing network infrastruc ..."
Abstract

Cited by 760 (8 self)
 Add to MetaCart
infrastructure or administration. The protocol is composed of the two mechanisms of Route Discovery and Route Maintenance, which work together to allow nodes to discover and maintain source routes to arbitrary destinations in the ad hoc network. The use of source routing allows packet routing to be trivially
Randomized Gossip Algorithms
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2006
"... Motivated by applications to sensor, peertopeer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join a ..."
Abstract

Cited by 532 (5 self)
 Add to MetaCart
distribute the computational burden and in which a node communicates with a randomly chosen neighbor. We analyze the averaging problem under the gossip constraint for an arbitrary network graph, and find that the averaging time of a gossip algorithm depends on the second largest eigenvalue of a doubly
Practical Byzantine fault tolerance
, 1999
"... This paper describes a new replication algorithm that is able to tolerate Byzantine faults. We believe that Byzantinefaulttolerant algorithms will be increasingly important in the future because malicious attacks and software errors are increasingly common and can cause faulty nodes to exhibit arbi ..."
Abstract

Cited by 673 (15 self)
 Add to MetaCart
This paper describes a new replication algorithm that is able to tolerate Byzantine faults. We believe that Byzantinefaulttolerant algorithms will be increasingly important in the future because malicious attacks and software errors are increasingly common and can cause faulty nodes to exhibit
High dimensional graphs and variable selection with the Lasso
 ANNALS OF STATISTICS
, 2006
"... The pattern of zero entries in the inverse covariance matrix of a multivariate normal distribution corresponds to conditional independence restrictions between variables. Covariance selection aims at estimating those structural zeros from data. We show that neighborhood selection with the Lasso is a ..."
Abstract

Cited by 733 (22 self)
 Add to MetaCart
is a computationally attractive alternative to standard covariance selection for sparse highdimensional graphs. Neighborhood selection estimates the conditional independence restrictions separately for each node in the graph and is hence equivalent to variable selection for Gaussian linear models. We
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 674 (15 self)
 Add to MetaCart
. Introduction The task of calculating posterior marginals on nodes in an arbitrary Bayesian network is known to be NP hard In this paper we investigate the approximation performance of "loopy belief propagation". This refers to using the wellknown Pearl polytree algorithm [12] on a Bayesian network
Results 1  10
of
294,827