Sciweavers

77 search results - page 9 / 16
» Probabilistic Communication Complexity Over The Reals
Sort
View
MICCAI
2010
Springer
13 years 6 months ago
Detecting Brain Activation in fMRI Using Group Random Walker
Due to the complex noise structure of functional magnetic resonance imaging (fMRI) data, methods that rely on information within a single subject often results in unsatisfactory fu...
Bernard Ng, Ghassan Hamarneh, Rafeef Abugharbieh
CVPR
2011
IEEE
13 years 3 months ago
Learning Temporally Consistent Rigidities
We present a novel probabilistic framework for rigid tracking and segmentation of shapes observed from multiple cameras. Most existing methods have focused on solving each of thes...
Jean-Sebastien Franco, Edmond Boyer
SIGCOMM
2009
ACM
14 years 2 months ago
Temporal distance metrics for social network analysis
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
John Tang, Mirco Musolesi, Cecilia Mascolo, Vito L...
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
14 years 8 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
ECCC
2006
120views more  ECCC 2006»
13 years 7 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin