Sciweavers

6251 search results - page 1250 / 1251
» Randomness, Computability, and Density
Sort
View
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 3 months ago
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
Yaniv Plan, Roman Vershynin
PLDI
2012
ACM
11 years 10 months ago
Test-case reduction for C compiler bugs
To report a compiler bug, one must often find a small test case that triggers the bug. The existing approach to automated test-case reduction, delta debugging, works by removing ...
John Regehr, Yang Chen, Pascal Cuoq, Eric Eide, Ch...
INFOCOM
2012
IEEE
11 years 10 months ago
Truthful spectrum auction design for secondary networks
Abstract—Opportunistic wireless channel access by nonlicensed users has emerged as a promising solution for addressing the bandwidth scarcity challenge. Auctions represent a natu...
Yuefei Zhu, Baochun Li, Zongpeng Li
TKDE
2012
199views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang
FCT
2009
Springer
14 years 2 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
« Prev « First page 1250 / 1251 Last » Next »