2365 search results - page 272 / 473 » All things are connected |
191
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
147
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
179
click to vote
ICS
2010
Tsinghua U.
16 years 4 months ago
2010
Tsinghua U.
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
181
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
207
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...