Sciweavers

2996 search results - page 68 / 600
» Numberings and Randomness
Sort
View
DM
2010
140views more  DM 2010»
13 years 10 months ago
Online Ramsey games for triangles in random graphs
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
József Balogh, Jane Butterfield
ICMLA
2008
13 years 11 months ago
Highly Scalable SVM Modeling with Random Granulation for Spam Sender Detection
Spam sender detection based on email subject data is a complex large-scale text mining task. The dataset consists of email subject lines and the corresponding IP address of the em...
Yuchun Tang, Yuanchen He, Sven Krasser
JSAC
2008
98views more  JSAC 2008»
13 years 10 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
ICDCS
2011
IEEE
12 years 9 months ago
SpotME If You Can: Randomized Responses for Location Obfuscation on Mobile Phones
Abstract—Nowadays companies increasingly aggregate location data from different sources on the Internet to offer locationbased services such as estimating current road traffic c...
Daniele Quercia, Ilias Leontiadis, Liam McNamara, ...
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
14 years 3 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin