Results 1  10
of
836,108
Photos monte carlo: A precision tool for qed corrections in z and w decays, Eur
 Phys. J. C45
"... We present a discussion of the precision for the PHOTOS Monte Carlo algorithm, with improved implementation of QED interference and multiplephoton radiation. The main application of PHOTOS is the generation of QED radiative corrections in decays of any resonances, simulated by a “host ” Monte Carlo ..."
Abstract

Cited by 185 (0 self)
 Add to MetaCart
Carlo generator. By careful comparisons automated with the help of the MCTESTER tool specially tailored for that purpose, we found that the precision of the current version of PHOTOS is of 0.1 % in the case of Z and W decays. In the general case, the precision of PHOTOS was also improved
max
"... plan toph grea quen thor verm Stre rot s cagi isola perc ence tomy agai rhiz bium spec majo grou ..."
Abstract
 Add to MetaCart
plan toph grea quen thor verm Stre rot s cagi isola perc ence tomy agai rhiz bium spec majo grou
= arg max
"... Abstract. In this paper, we present the effect of the semantic indexing using WordNet senses on the Information Retrieval (IR) and Text Categorization (TC) tasks. The documents have been sensetagged using a Word Sense Disambiguation (WSD) system based on Specialized Hidden Markov Models (SHMMs). Th ..."
Abstract
 Add to MetaCart
of sense tags considered, and W, the vocabulary of the application. Given an input sentence, W = w1,..., wT, where wi ∈ W, the tagging process consists of finding the sequence of senses (S = s1,..., sT, where si ∈ S) of maximum probability on the model, that is: �S = arg max P (SW)
RxW: A Scheduling Approach for LargeScale OnDemand Data Broadcast
, 1999
"... Broadcast is becoming an increasingly attractive data dissemination method for large client populations. In order to effectively utilize a broadcast medium for sucha service, it is necessary to have efficient, online scheduling algorithms that can balance individual and overall performance, and ca ..."
Abstract

Cited by 116 (2 self)
 Add to MetaCart
, and can scale in terms of data set sizes, client populations, and broadcast bandwidth. We propose an algorithm, called RxW, that provides good performance across all of these criteria and that can be tuned to trade o# average and worst case waiting time. Unlike previous work on lowoverhead scheduling
Better Approximations for Max TSP
 Information Processing Letters
, 1998
"... We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected value of at least r times the optimal one for any given r ! 25 33 . Keywords: Analysis of algorithms, maximum traveling ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
salesman, maximum latency TSP. 1 Introduction Let G = (V; E) be a complete (undirected) graph with vertex set V and edge set E. For e 2 E let w(e) 0 be its weight. For E 0 ` E we denote w(E 0 ) = P e2E 0 w(e): For a random subset E 0 ` E, w(E 0 ) denotes the expected value. The maximum
Core Based Trees (CBT version 2) Multicast Routing: Protocol Specification", RFC 2189
, 1997
"... This memo defines an Experimental Protocol for the Internet community. It does not specify an Internet standard of any kind. Discussion and suggestions for improvement are requested. Distribution of this memo is unlimited. This document describes the Core Based Tree (CBT version 2) network layer mul ..."
Abstract

Cited by 138 (1 self)
 Add to MetaCart
This memo defines an Experimental Protocol for the Internet community. It does not specify an Internet standard of any kind. Discussion and suggestions for improvement are requested. Distribution of this memo is unlimited. This document describes the Core Based Tree (CBT version 2) network layer multicast routing protocol. CBT builds a shared multicast distribution tree per group, and is suited to inter and intradomain multicast routing. CBT may use a separate multicast routing table, or it may use that of underlying unicast routing, to establish paths between senders and receivers. The CBT architecture is described in [1]. This document is progressing through the IDMR working group of the IETF. CBT related documents include [1, 5, 6]. For all IDMRrelated
Stationary maxstable fields associated to negative definite functions, Ann
 Prob
, 2009
"... Let Wi,i ∈ N, be independent copies of a zeromean Gaussian process {W(t),t ∈ R d} with stationary increments and variance σ 2 (t). Independently of Wi, let ∑∞ i=1 δUi be a Poisson point process on the real line with intensity e −y dy. We show that the law of the random family of functions {Vi(·),i ..."
Abstract

Cited by 61 (12 self)
 Add to MetaCart
Let Wi,i ∈ N, be independent copies of a zeromean Gaussian process {W(t),t ∈ R d} with stationary increments and variance σ 2 (t). Independently of Wi, let ∑∞ i=1 δUi be a Poisson point process on the real line with intensity e −y dy. We show that the law of the random family of functions {Vi
Buffer Minimization Using MaxColoring
, 2003
"... Given a graph G = (V, E) and positive integral vertex weights w: V → N, the maxcoloring problem seeks to find a proper vertex coloring of G whose color classes C_1, C_2, ..., C_k, minimize i=1 max v#C i w(v). This problem, restricted to interval graphs, arises whenever there is a need to d ..."
Abstract

Cited by 33 (2 self)
 Add to MetaCart
Given a graph G = (V, E) and positive integral vertex weights w: V → N, the maxcoloring problem seeks to find a proper vertex coloring of G whose color classes C_1, C_2, ..., C_k, minimize i=1 max v#C i w(v). This problem, restricted to interval graphs, arises whenever there is a need
Results 1  10
of
836,108