Sciweavers

5785 search results - page 869 / 1157
» Approximability of Probability Distributions
Sort
View
ALT
2007
Springer
15 years 11 months ago
On Universal Transfer Learning
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
M. M. Hassan Mahmud
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
15 years 11 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
COCO
2007
Springer
85views Algorithms» more  COCO 2007»
15 years 11 months ago
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
Emanuele Viola, Avi Wigderson
120
Voted
TGC
2007
Springer
15 years 11 months ago
Adversaries and Information Leaks (Tutorial)
Secure information flow analysis aims to prevent programs from leaking their H (high) inputs to their L (low) outputs. A major challenge in this area is to relax the standard noni...
Geoffrey Smith
GLOBECOM
2006
IEEE
15 years 11 months ago
Outage Performance of Cognitive Wireless Relay Networks
— In this paper, we investigate the outage performance of cognitive wireless relay networks where source nodes communicate to their destinations via multiple hops facilitated by ...
Kyounghwan Lee, Aylin Yener