Sciweavers

1511 search results - page 68 / 303
» On the effectiveness of address-space randomization
Sort
View
CIKM
2008
Springer
13 years 9 months ago
A random walk on the red carpet: rating movies with user reviews and pagerank
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
Derry Tanti Wijaya, Stéphane Bressan
PRL
2002
67views more  PRL 2002»
13 years 7 months ago
A pseudo-nearest-neighbor approach for missing data recovery on Gaussian random data sets
Missing data handling is an important preparation step for most data discrimination or mining tasks. Inappropriate treatment of missing data may cause large errors or false result...
Xiaolu Huang, Qiuming Zhu
SAC
2008
ACM
13 years 7 months ago
Synchronization of strongly pulse-coupled oscillators with refractory periods and random medium access
The weakly pulse-coupled oscillator framework has proven to be a valuable resource for the development of peer-to-peer synchronization algorithms [9]. But leveraging it in a pract...
Julius Degesys, Prithwish Basu, Jason Redi
CORR
2010
Springer
80views Education» more  CORR 2010»
13 years 6 months ago
High-Throughput Random Access via Codes on Graphs
—Recently, contention resolution diversity slotted ALOHA (CRDSA) has been introduced as a simple but effective improvement to slotted ALOHA. It relies on MAC burst repetitions an...
Gianluigi Liva, Enrico Paolini, Marco Chiani
TIT
2010
113views Education» more  TIT 2010»
13 years 2 months ago
Asynchronous CDMA systems with random spreading-part II: design criteria
Totally asynchronous code-division multiple-access (CDMA) systems are addressed. In part I, the fundamental limits of asynchronous CDMA systems were analyzed in terms of total cap...
Laura Cottatellucci, Ralf R. Müller, Mé...