2434 search results - page 168 / 487 » Algorithmic Randomness of Closed Sets |
125
click to vote
SADM
2008
15 years 3 months ago
2008
: In this paper, we introduce the concept of -orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are -orthogonal if their similarit...
115
Voted
GRAPHICSINTERFACE
2007
15 years 5 months ago
2007
One significant problem in tile-based texture synthesis is the presence of conspicuous seams in the tiles. The reason is that the sample patches employed as primary patterns of t...
143
Voted
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
159
click to vote
NIPS
2007
15 years 5 months ago
2007
In this paper we model relational random variables on the edges of a network using Gaussian processes (GPs). We describe appropriate GP priors, i.e., covariance functions, for dir...
RSA
1998
15 years 3 months ago
1998
A periodic tree Tn consists of full n-level copies of a finite tree T. The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjace...