Join Our Newsletter

JSCIC

2010

9 years 6 months ago
2010

A quantity known as the Kemeny constant, which is used to measure the expected number of links that a surfer on the World Wide Web, located on a random web page, needs to follow b...

DMTCS

2010

9 years 9 months ago
2010

We give a new expression for the expected number of inversions in the product of

ALGORITHMICA

1999

9 years 11 months ago
1999

Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...

RSA

2000

9 years 11 months ago
2000

The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...

JCO

2007

9 years 11 months ago
2007

The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...

IJNSEC

2007

9 years 11 months ago
2007

In this work, we show that the current termination condition of the Probabilistic Packet Marking (PPM) algorithm is not correct for general networks, and this implies the estimati...

SIAMDM

2008

9 years 11 months ago
2008

For a rooted graph G, let EV (G; p) be the expected number of vertices reachable from the root when each edge has an independent probability p of operating successfully. We examine...

DCG

2010

9 years 12 months ago
2010

: This paper studies the convex hull of n random points in Rd. A recently-proved topological identity of the author is used in combination with identities of Efron and Buchta to fi...

CORR

2008

Springer

9 years 12 months ago
2008

Springer

Let A be an n by N real valued random matrix, and HN denote the N-dimensional hypercube. For numerous random matrix ensembles, the expected number of k-dimensional faces of the ran...

SODA

1993

ACM

10 years 1 months ago
1993

ACM

We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched...