Sciweavers

3257 search results - page 53 / 652
» Some Results on Effective Randomness
Sort
View
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
14 years 1 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
ICYCS
2008
IEEE
14 years 4 months ago
Propagation Model of Active Worms in P2P Networks
P2P worms pose heavy threatens to P2P networks. P2P worms exploit common vulnerabilities in member hosts of a P2P network and spread topologically in the P2P network, a potentiall...
Chao-sheng Feng, Zhiguang Qin, Laurence Cuthbet, L...
ET
2002
84views more  ET 2002»
13 years 9 months ago
Hardware Generation of Random Single Input Change Test Sequences
The combination of higher quality requirements and sensitivity of high performance circuits to delay defects has led to an increasing emphasis on delay testing of VLSI circuits. A...
René David, Patrick Girard, Christian Landr...
CVPR
2010
IEEE
14 years 5 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr
CIKM
2011
Springer
12 years 9 months ago
Relative effect of spam and irrelevant documents on user interaction with search engines
Meaningful evaluation of web search must take account of spam. Here we conduct a user experiment to investigate whether satisfaction with search engine result pages as a whole is ...
Timothy Jones, David Hawking, Paul Thomas, Ramesh ...