Sciweavers

183 search results - page 23 / 37
» Analyzing graph structure via linear measurements
Sort
View
TCC
2007
Springer
124views Cryptology» more  TCC 2007»
14 years 1 months ago
Tackling Adaptive Corruptions in Multicast Encryption Protocols
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
Saurabh Panjwani
DCOSS
2010
Springer
13 years 11 months ago
Approximate Distributed Kalman Filtering for Cooperative Multi-agent Localization
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
Prabir Barooah, Wm. Joshua Russell, João P....
ICDAR
2003
IEEE
14 years 25 days ago
Study of the Consistency of Some Discriminatory Features Used by Document Examiners in the Analysis of Handwritten Letter 'a'
In this paper a study of some structural features of handwritten letter ‘a’ is presented. The features under consideration are structural, style and formation features documen...
Philip Jonathan Sutanto, Graham Leedham, Vladimir ...
CIBCB
2007
IEEE
14 years 1 months ago
Evolving Extremal Epidemic Networks
The susceptible, infected, removed model for epidemics assumes that the population in which the epidemic takes place is well mixed. This strong assumption can be relaxed by permit...
Dan Ashlock, Fatemeh Jafargholi
CVPR
2012
IEEE
11 years 10 months ago
See all by looking at a few: Sparse modeling for finding representative objects
We consider the problem of finding a few representatives for a dataset, i.e., a subset of data points that efficiently describes the entire dataset. We assume that each data poi...
Ehsan Elhamifar, Guillermo Sapiro, René Vid...