Sciweavers

32 search results - page 3 / 7
» On the Complexity of the Montes Ideal Factorization Algorith...
Sort
View
ASIACRYPT
2009
Springer
14 years 11 days ago
Security Bounds for the Design of Code-Based Cryptosystems
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
Matthieu Finiasz, Nicolas Sendrier
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
14 years 6 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
LWA
2004
13 years 7 months ago
Dirichlet Enhanced Latent Semantic Analysis
This paper describes nonparametric Bayesian treatments for analyzing records containing occurrences of items. The introduced model retains the strength of previous approaches that...
Kai Yu, Shipeng Yu, Volker Tresp
IJCAI
2003
13 years 7 months ago
On the Design of Social Diagnosis Algorithms for Multi-Agent Teams
Teamwork demands agreement among teammembers to collaborate and coordinate effectively. When a disagreement between teammates occurs (due to failures), team-members should ideally...
Meir Kalech, Gal A. Kaminka
PROPERTYTESTING
2010
13 years 3 months ago
Sublinear Algorithms in the External Memory Model
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...