Sciweavers

230 search results - page 40 / 46
» Information Space Gets Normal
Sort
View
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 5 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
LATIN
2004
Springer
15 years 10 months ago
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
237
Voted
COBUILD
1999
Springer
15 years 9 months ago
Bringing the Marks on a Whiteboard to Electronic Life
This paper discusses our implementation and experience with a camera-based whiteboard scanner. The ZombieBoard system (so called because it brings to electronic life the marks on a...
Eric Saund
ICDCS
1995
IEEE
15 years 8 months ago
Specifying Weak Sets
nt formal speci cations of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide...
Jeannette M. Wing, David C. Steere
AAAI
2010
15 years 6 months ago
G-Optimal Design with Laplacian Regularization
In many real world applications, labeled data are usually expensive to get, while there may be a large amount of unlabeled data. To reduce the labeling cost, active learning attem...
Chun Chen, Zhengguang Chen, Jiajun Bu, Can Wang, L...