Results 11  20
of
9,490
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 676 (15 self)
 Add to MetaCart
;belief revision") version, Weiss For the case of networks with multiple loops, Richard son To summarize, what is currently known about loopy propagation is that ( 1) it works very well in an error correcting code setting and (2) there are conditions for a singleloop network for which it can be guaranteed
Dynamics of Random Early Detection
 In Proceedings of ACM SIGCOMM
, 1997
"... In this paper we evaluate the effectiveness of Random Early Detection (RED) over traffic types categorized as nonadaptive, fragile and robust, according to their responses to congestion. We point out that RED allows unfair bandwidth sharing when a mixture of the three traffic types shares a link Thi ..."
Abstract

Cited by 465 (1 self)
 Add to MetaCart
This urlfairness is caused by the fact that at any given time RED imposes the same loss rate on all jlows, regardless of their bandwidths. We propose Fair Random Early Drop (FRED), a modified version of RED. FRED uses peractivejlow accounting to impose 011 each flow a loss rate that depends on the flow’s buffer
MORE MIXED TSIRELSON SPACES THAT ARE NOT ISOMORPHIC TO THEIR MODIFIED VERSIONS
, 2006
"... Abstract. The class of mixed Tsirelson spaces is an important source of examples in the recent development of the structure theory of Banach spaces. The related class of modified mixed Tsirelson spaces has also been well studied. In the present paper, we investigate the problem of comparing isomorph ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
isomorphically the mixed Tsirelson space T[(Sn, θn) ∞ n=1] and its modified version TM[(Sn, θn) ∞ n=1]. It is shown that these spaces are not isomorphic for a large class of parameters (θn). 1.
The iSLIP Scheduling Algorithm for InputQueued Switches
, 1999
"... An increasing number of high performance internetworking protocol routers, LAN and asynchronous transfer mode (ATM) switches use a switched backplane based on a crossbar switch. Most often, these systems use input queues to hold packets waiting to traverse the switching fabric. It is well known th ..."
Abstract

Cited by 425 (8 self)
 Add to MetaCart
, roundrobin algorithm, iSLIP can achieve 100% throughput for uniform traffic, yet is simple to implement in hardware. Iterative and noniterative versions of the algorithms are presented, along with modified versions for prioritized traffic. Simulation results are presented to indicate the performance
On the convergence of a modified version of SVM light algorithm
 Optimization Methods and Software
, 2005
"... In this work we consider the convex quadratic programming problem arising in Support Vector Machine (SVM), which is a technique designed to solve a variety of learning and pattern recognition problems. Since the Hessian matrix is dense and real applications lead to large scale problems, several deco ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
In this work we consider the convex quadratic programming problem arising in Support Vector Machine (SVM), which is a technique designed to solve a variety of learning and pattern recognition problems. Since the Hessian matrix is dense and real applications lead to large scale problems, several decomposition methods have been proposed, that split the original problem into a sequence of smaller subproblems. SVM light algorithm is a commonly used decomposition method for SVM, and its convergence has been proved only recently under a suitable blockwise convexity assumption on the objective function. In SVM light algorithm, the size q of the working set, i.e. the dimension of the subproblem, can be any even number. In the present paper we propose a decomposition method based on a proximal point modification of the subproblem and on a working set selection rule that includes, as a particular case, the one used by the SVM light algorithm. We establish the asymptotic convergence of the method, for any size q ≥ 2 of the working set, and without requiring any further blockwise convexity assumption on the objective function. Furthermore we show that the algorithm satisfies in a finite number of iterations a stopping criterion based on the violation of the optimality conditions.
Reliability and validity study of Persian modified version of MUSIC
, 2007
"... (musculoskeletal intervention center) – Norrtalje questionnaire ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(musculoskeletal intervention center) – Norrtalje questionnaire
Ant Colony Optimization: A Modified Version
"... Antnet is an agent based routing algorithm based on real ants' behavior. In real life, ants drop some kind of chemical substances to mark the path that they used. Then on their way back they choose the path with the highest pheromones which becomes the shortest path. Ants in antnet algorithm ar ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
exclusive optimal paths as compared to single optimal path in original antnet routing by introducing a little overhead. This proposed modified algorithm optimizes the antnet routing by a better throughput.
The Antnet Routing Algorithm A Modified Version
"... Abstract – Antnet is an agent based routing algorithm that is influenced from the unsophisticated and individual ant’s emergent behaviour. Ants (software agents) are used in antnet to collect information and to update the probabilistic distance vector routing table entries. Modified antnet algorithm ..."
Abstract
 Add to MetaCart
Abstract – Antnet is an agent based routing algorithm that is influenced from the unsophisticated and individual ant’s emergent behaviour. Ants (software agents) are used in antnet to collect information and to update the probabilistic distance vector routing table entries. Modified antnet
GMNFDVMRP: A Modified Version of Distance Vector Multicast Routing Protocol
"... In this paper, we make a survey of Distance Vector Multicast Routing Protocol (DVMRP) andfind that it is not optimal in the aspect of network cost (NC). Therefore, we propose a modified version of DVMRP, called “Group Membership Near FirstDVMRP ” (GMNFDVMRP), to decrease the NC of the multicast tr ..."
Abstract
 Add to MetaCart
In this paper, we make a survey of Distance Vector Multicast Routing Protocol (DVMRP) andfind that it is not optimal in the aspect of network cost (NC). Therefore, we propose a modified version of DVMRP, called “Group Membership Near FirstDVMRP ” (GMNFDVMRP), to decrease the NC of the multicast
(Modified version) Average Kinetic Energy of Heavy Quark in
, 1996
"... Within the ACCMM model the average kinetic energy of heavy quark in a heavylight meson is calculated as 〈p2 〉 = 3 2p 2, solely from the fact that the GausF sian momentum probability distribution has been taken in the ACCMM model. Therefore, the Fermi momentum parameter p F of the ACCMM model is n ..."
Abstract
 Add to MetaCart
Within the ACCMM model the average kinetic energy of heavy quark in a heavylight meson is calculated as 〈p2 〉 = 3 2p 2, solely from the fact that the GausF sian momentum probability distribution has been taken in the ACCMM model. Therefore, the Fermi momentum parameter p F of the ACCMM model is not a truly free parameter, but is closely related to the average kinetic energy of heavy quark, which is theoretically calculable in principle. In this context, we determine p F by comparing the theoretical prediction of the ACCMM model with the model independent lepton energy spectrum of B → eνX from the recent CLEO analysis, and find that p F = 0.54 ± 0.16 0.15 GeV. We also calculate p F in the relativistic quark model by applying the quantum mechanical variational method, and obtained p F = 0.5 ∼ 0.6 GeV. We show the correspondences between the relativistic quark model and the heavy quark effective theory. We then clarify the importance of the value of p F in the determination of Vub/Vcb.
Results 11  20
of
9,490