Sciweavers

2173 search results - page 434 / 435
» On the Values of Reducibility Candidates
Sort
View
ICALP
2011
Springer
12 years 12 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
JAMIA
2011
140views more  JAMIA 2011»
12 years 11 months ago
Never too old for anonymity: a statistical standard for demographic data sharing via the HIPAA Privacy Rule
Objective Healthcare organizations must de-identify patient records before sharing data. Many organizations rely on the Safe Harbor Standard of the HIPAAPrivacy Rule, which enumer...
Bradley Malin, Kathleen Benitez, Daniel R. Masys
DCOSS
2011
Springer
12 years 8 months ago
A local average consensus algorithm for wireless sensor networks
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...
Konstantin Avrachenkov, Mahmoud El Chamie, Giovann...
IACR
2011
104views more  IACR 2011»
12 years 8 months ago
Short Transitive Signatures for Directed Trees
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
Philippe Camacho, Alejandro Hevia
CORR
2012
Springer
228views Education» more  CORR 2012»
12 years 4 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled