Results 11  20
of
1,180,074
Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems
, 1997
"... The minimum cut and minimum length linear arrangement problems usually occur in solving wiring problems and have a lot in common with job sequencing questions. Both problems are NPcomplete for general graphs and in P for trees. We present here two parallel algorithms for the CREW PRAM. The first so ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The minimum cut and minimum length linear arrangement problems usually occur in solving wiring problems and have a lot in common with job sequencing questions. Both problems are NPcomplete for general graphs and in P for trees. We present here two parallel algorithms for the CREW PRAM. The first
Minimum Error Rate Training in Statistical Machine Translation
, 2003
"... Often, the training procedure for statistical machine translation models is based on maximum likelihood or related criteria. A general problem of this approach is that there is only a loose relation to the final translation quality on unseen text. In this paper, we analyze various training cri ..."
Abstract

Cited by 663 (7 self)
 Add to MetaCart
Often, the training procedure for statistical machine translation models is based on maximum likelihood or related criteria. A general problem of this approach is that there is only a loose relation to the final translation quality on unseen text. In this paper, we analyze various training criteria which directly optimize translation quality.
Random minimum length spanning trees in regular graphs
"... Consider a connected rregular nvertex graph G with random independent edge lengths, each uniformly distributed on (0;1). Let mst(G) be the expected length of a minimum spanning tree. We show that mst(G) can be estimated quite accurately under two distinct circumstances. Firstly, if r is large and ..."
Abstract

Cited by 21 (9 self)
 Add to MetaCart
Consider a connected rregular nvertex graph G with random independent edge lengths, each uniformly distributed on (0;1). Let mst(G) be the expected length of a minimum spanning tree. We show that mst(G) can be estimated quite accurately under two distinct circumstances. Firstly, if r is large
A Note on Random Minimum Length Spanning Trees
 JOURNAL OF COMBINATORICS
, 2000
"... Consider a connected rregular nvertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let rest(G) be the expected length of a minimum spanning tree. We show in this paper that if G is sufficiently highly edge connected then the expected length of a minimum sp ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
Consider a connected rregular nvertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let rest(G) be the expected length of a minimum spanning tree. We show in this paper that if G is sufficiently highly edge connected then the expected length of a minimum
The minimum description length principle in coding and modeling
 IEEE TRANS. INFORM. THEORY
, 1998
"... We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the solution to optimum universal coding problems extending Shannon’s basic source coding theorem. The normalized maximized ..."
Abstract

Cited by 390 (17 self)
 Add to MetaCart
We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the solution to optimum universal coding problems extending Shannon’s basic source coding theorem. The normalized maximized
A HighThroughput Path Metric for MultiHop Wireless Routing
, 2003
"... This paper presents the expected transmission count metric (ETX), which finds highthroughput paths on multihop 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 1078 (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 hopcount metric chooses arbitrarily among the different paths of the same minimum length
Insiders and Outsiders: The Choice between Informed and Arm'sLength Debt
, 1991
"... While the benefits of bank financing are relatively well understood, the costs are not. This paper argues that while informed banks make flexible financial decisions which prevent a firm's projects from going awry, the cost of this credit is that banks have bargaining power over the firm's ..."
Abstract

Cited by 846 (18 self)
 Add to MetaCart
While the benefits of bank financing are relatively well understood, the costs are not. This paper argues that while informed banks make flexible financial decisions which prevent a firm's projects from going awry, the cost of this credit is that banks have bargaining power over the firm's profits, once projects have begun. The firm's portfolio choice of borrowing source and the choice of priority for its debt claims attempt to optimally circumscribe the powers of banks.
On the value of a random minimum length Steiner tree
"... Consider a complete graph on n vertices with edge lengths chosen randomly and independently from e.g., an exponential distribution with parameter 1. Fix k vertices and consider the minimal length Steiner tree which contains these vertices. We prove that with high probability the length of this tr ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
of this tree is (k 1) log n n + o( log n n ) when k = const and n !1. 1 Introduction Given an arbitrary weighted graph with a xed set of vertices, the Steiner Tree Problem is the task of nding a minimumcost subtree containing all these vertices. The length of a tree is dened to be the sum of the lengths
Segmenting and Compressing Waveforms by Minimum Length Encoding
"... The paradigm of minimal length encoding is used for superior segmenting and compressing of waveforms. These methods sre shown to be applicable also for segmenting and edge finding in pictures. Introduction Minimal length encoding as a way of describing and explaining information has a long history ..."
Abstract
 Add to MetaCart
. This principle has been much used since then resulting in shorter and easier to explain or compute theories. In computer science and statistics this idea is known as Kolmogorov complexity. It has also appeared in Valiant's learning theory and Rissansen's minimum description length principle. For more
Exact solution of inflationary model with minimum length,” Phys
 Rev. D
"... Within the inflationary scenario, Planck scale physics should have affected the comoving modes ’ initial conditions and early evolution, thereby potentially affecting the inflationary predictions for the cosmic microwave background (CMB). This issue has been studied extensively on the basis of vario ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Within the inflationary scenario, Planck scale physics should have affected the comoving modes ’ initial conditions and early evolution, thereby potentially affecting the inflationary predictions for the cosmic microwave background (CMB). This issue has been studied extensively on the basis of various models for how quantum field theory (QFT) is modified and finally breaks down towards the Planck scale. In one model, in particular, an ultraviolet cutoff was implemented into QFT through generalized uncertainty relations which have been motivated from general quantum gravity arguments and from string theory. Here, we improve upon prior numerical and semianalytical results by presenting the exact mode solutions for both de Sitter and powerlaw inflation in this model. This provides an explicit map from the modes’ initial conditions, which are presumably set by quantum gravity, to the modes ’ amplitudes at horizon crossing and thus to the inflationary predictions for the CMB. The solutions ’ particular behaviour close to the cutoff scale suggests unexpected possibilities for how the degrees of freedom of QFT emerge from the Planck scale. 1 1
Results 11  20
of
1,180,074