2681 search results - page 148 / 537 » Problem F |
TLDI
2009
ACM
14 years 7 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
AAIM
2008
Springer
14 years 4 months ago
2008
Springer
For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with co...
ICIP
2007
IEEE
14 years 4 months ago
2007
IEEE
We propose a framework for exploiting dimension-reducing random projections in detection and classification problems. Our approach is based on the generalized likelihood ratio te...
INFOCOM
2006
IEEE
14 years 4 months ago
2006
IEEE
Abstract— Verifying the accuracy of a passive measurementsbased inference technique under all possible network scenarios is a difficult challenge - the measurement point has lim...