5592 search results - page 261 / 1119 » On Random Betweenness Constraints |
189
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
148
click to vote
TIT
2008
15 years 6 months ago
2008
A popular way to measure the degree of dependence between two random objects is by their mutual information, defined as the divergence between the joint and product-of-marginal dis...
136
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
The goal of this research is the improvement of browsing voluminous InkML data in two areas: ease of rendering continuous inkflow for replay-browsing, and ease of random access na...
183
click to vote
STACS
2007
Springer
16 years 19 days ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
183
click to vote
TSD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. This paper suggests a novel representation for documents that is intended to improve precision. This representation is generated by combining two central techniques: Rand...