4377 search results - page 185 / 876 » Mass problems and randomness |
167
click to vote
CP
2004
Springer
15 years 12 months ago
2004
Springer
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...
194
click to vote
SDM
2010
SIAM
15 years 8 months ago
2010
SIAM
Many sorts of structured data are commonly stored in a multi-relational format of interrelated tables. Under this relational model, exploratory data analysis can be done by using ...
170
click to vote
CSDA
2008
15 years 6 months ago
2008
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...
167
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements ...
179
click to vote
TIT
1998
15 years 6 months ago
1998
—We study the following problem: two agents Alice and Bob are connected to each other by independent discrete memoryless channels. They wish to generate common randomness, i.e., ...