Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
10,765
Orthogonal forward selection for constructing the radial basis function network with tunable nodes
- in Proc. Int. Conf. Intell. Comput
"... Abstract. An orthogonal forward selection (OFS) algorithm based on the leave-one-out (LOO) criterion is proposed for the construction of radial basis function (RBF) networks with tunable nodes. This OFS-LOO algorithm is computation-ally efficient and is capable of identifying parsimonious RBF networ ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
Abstract. An orthogonal forward selection (OFS) algorithm based on the leave-one-out (LOO) criterion is proposed for the construction of radial basis function (RBF) networks with tunable nodes. This OFS-LOO algorithm is computation-ally efficient and is capable of identifying parsimonious RBF
Rumor Routing Algorithm for Sensor Networks
, 2002
"... Advances in micro-sensor and radio technology will enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. In order to constrain communication overhead, dense sensor networks call for new and highly efficient methods for distributing queries to nodes ..."
Abstract
-
Cited by 417 (2 self)
- Add to MetaCart
node and resides in regions of the network [10][7][8]. This paper describes and evaluates through simulation a scheme we call Rumor Routing, which allows for queries to be delivered to events in the network. Rumor Routing is tunable, and allows for tradeoffs between setup overhead and delivery
A Scalable Distributed Information Management System
"... We present a Scalable Distributed Information Management System (SDIMS) that aggregates information about large-scale networked systems and that can serve as a basic building block for a broad range of large-scale distributed applications by providing detailed views of nearby information and summary ..."
Abstract
-
Cited by 192 (17 self)
- Add to MetaCart
extensions to current DHT algorithms, and (4) achieves robustness to node and network reconfigurations through lazy reaggregation, on-demand reaggregation, and tunable spatial replication. Through extensive simulations and micro-benchmark experiments, we observe that our system is an order of magnitude more
Construction of Tunable Radial Basis Function Networks Using Orthogonal Forward Selection
"... Abstract—An orthogonal forward selection (OFS) algorithm based on leave-one-out (LOO) criteria is proposed for the construction of radial basis function (RBF) networks with tunable nodes. Each stage of the construction process determines an RBF node, namely, its center vector and diagonal covariance ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
Abstract—An orthogonal forward selection (OFS) algorithm based on leave-one-out (LOO) criteria is proposed for the construction of radial basis function (RBF) networks with tunable nodes. Each stage of the construction process determines an RBF node, namely, its center vector and diagonal
Scalable Influence Maximization for Prevalent Viral Marketing in Large-Scale Social Networks
"... Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influence under certain influence cascade models. The scalability of influence maximization is a key factor for enabling preval ..."
Abstract
-
Cited by 183 (14 self)
- Add to MetaCart
new heuristic algorithm that is easily scalable to millions of nodes and edges in our experiments. Our algorithm has a simple tunable parameter for users to control the balance between the running time and the influence spread of the algorithm. Our results from extensive simulations on several real
A Tunable Mechanism for Identifying Trusted Nodes in Large Scale Distributed Networks
"... Abstract—In this paper, we propose a simple randomized protocol for identifying trusted nodes based on personalized trust in large scale distributed networks. The problem of identifying trusted nodes, based on personalized trust, in a large network setting stems from the huge computation and message ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract—In this paper, we propose a simple randomized protocol for identifying trusted nodes based on personalized trust in large scale distributed networks. The problem of identifying trusted nodes, based on personalized trust, in a large network setting stems from the huge computation
Tunable Survivable Spanning Trees
"... Coping with network failures has become a major network-ing challenge. The concept of tunable survivability provides a quantitative measure for specifying any desired level (0%-100%) of survivability, thus offering flexibility in the rout-ing choice. Previous works focused on implementing this conce ..."
Abstract
- Add to MetaCart
Coping with network failures has become a major network-ing challenge. The concept of tunable survivability provides a quantitative measure for specifying any desired level (0%-100%) of survivability, thus offering flexibility in the rout-ing choice. Previous works focused on implementing
for Tunable RF MEMS Passives
"... Abstract—This paper reports on a microfabrication technology for implementing high-performance passive components suitable for advanced RF front-ends. This technology offers three metal layers with different thicknesses, one dielectric, and two sacrificial layers, enabling the fabrication of continu ..."
Abstract
- Add to MetaCart
of continuously tuned capacitors, capacitive and ohmic switches, as well as high-Q inductors all on a single chip. To demonstrate the versatility of this technology, several passive components are fabricated on a Borosilicate glass substrate (εr = 4.6). A high-Q tunable capacitor is fabricated exhibiting
Results 1 - 10
of
10,765
