Sciweavers

7133 search results - page 1112 / 1427
» Communication algorithms with advice
Sort
View
KDD
2002
ACM
179views Data Mining» more  KDD 2002»
16 years 7 months ago
From Data To Insight: The Community Of Multimedia Agents
Multimedia Data Mining requires the ability to automatically analyze and understand the content. The Community of Multimedia Agents project (COMMA) is devoted to creating an open ...
Gang Wei, Valery A. Petrushin, Anatole Gershman
330
Voted
POPL
2005
ACM
16 years 7 months ago
Enterprise privacy promises and enforcement
Several formal languages have been proposed to encode privacy policies, ranging from the Platform for Privacy Preferences (P3P), intended for communicating privacy policies to con...
Adam Barth, John C. Mitchell
203
Voted
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 7 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
237
Voted
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
16 years 7 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
16 years 7 months ago
Cell-probe lower bounds for the partial match problem
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Raba...
« Prev « First page 1112 / 1427 Last » Next »