Sciweavers

2680 search results - page 491 / 536
» The topology of the independence complex
Sort
View
ASIACRYPT
2009
Springer
15 years 6 months ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 6 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
CONCUR
2009
Springer
15 years 6 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
15 years 6 months ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ...
Marek Lipczak, Evangelos E. Milios
SIGIR
2009
ACM
15 years 6 months ago
Learning to recommend with social trust ensemble
As an indispensable technique in the field of Information Filtering, Recommender System has been well studied and developed both in academia and in industry recently. However, mo...
Hao Ma, Irwin King, Michael R. Lyu