642 search results - page 68 / 129 » corr 2006 |
CORR
2006
Springer
15 years 17 days ago
2006
Springer
Suppose we are given two probability measures on the set of one-way infinite finite-alphabet sequences and consider the question when one of the measures predicts the other, that ...
107
click to vote
CORR
2006
Springer
15 years 17 days ago
2006
Springer
Currently many different modeling languages are used for workflow definitions in BPM systems. Authors of this paper analyze the two most popular graphical languages, with highest p...
101
Voted
CORR
2006
Springer
15 years 17 days ago
2006
Springer
: The formalizations of periods of time inside a linear model of Time are usually based on the notion of intervals, that may contain or may not their endpoints. This is not enough ...
103
click to vote
CORR
2006
Springer
15 years 17 days ago
2006
Springer
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...
CORR
2006
Springer
15 years 17 days ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...