Sciweavers

534 search results - page 70 / 107
» Power from Random Strings
Sort
View
WIDM
2004
ACM
14 years 3 months ago
Probabilistic models for focused web crawling
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...
Hongyu Liu, Evangelos E. Milios, Jeannette Janssen
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
14 years 1 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 9 months ago
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a po...
Ayfer Özgür, Olivier Lévêqu...
PR
2008
137views more  PR 2008»
13 years 9 months ago
Cancellable biometrics and annotations on BioHash
Lately, the once powerful one-factor authentication which is based solely on either password, token or biometric approach, appears to be insufficient in addressing the challenges ...
Andrew Beng Jin Teoh, Yip Wai Kuan, Sangyoun Lee
TDSC
2008
121views more  TDSC 2008»
13 years 9 months ago
Multipath Key Establishment for Wireless Sensor Networks Using Just-Enough Redundancy Transmission
In random key predistribution techniques for wireless sensor networks, a relatively small number of keys are randomly chosen from a large key pool and are loaded on the sensors pri...
Jing Deng, Yunghsiang S. Han