Sciweavers

2797 search results - page 74 / 560
» Code query by example
Sort
View
ALT
1998
Springer
15 years 6 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
STOC
2012
ACM
201views Algorithms» more  STOC 2012»
13 years 4 months ago
From irreducible representations to locally decodable codes
Locally Decodable Code (LDC) is a code that encodes a message in a way that one can decode any particular symbol of the message by reading only a constant number of locations, eve...
Klim Efremenko
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
15 years 4 months ago
Corruption and Recovery-Efficient Locally Decodable Codes
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...
David P. Woodruff
WCRE
2009
IEEE
15 years 9 months ago
An Exploratory Study of the Impact of Code Smells on Software Change-proneness
—Code smells are poor implementation choices, thought to make object-oriented systems hard to maintain. In this study, we investigate if classes with code smells are more change-...
Foutse Khomh, Massimiliano Di Penta, Yann-Gaë...
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 2 months ago
Efficient Sketches for the Set Query Problem
We develop an algorithm for estimating the values of a vector x Rn over a support S of size k from a randomized sparse binary linear sketch Ax of size O(k). Given Ax and S, we ca...
Eric Price