12459 search results - page 2338 / 2492 » cans 2006 |
181
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
201
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
A family of subsets C of [n] def = {1, . . . , n} is (r, t)exclusive if for every S ⊂ [n] of size at least n − r, there exist S1, . . . , St ∈ C with S = S1∪S2∪· · · ...
196
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
254
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
We introduce a game theoretic model of network formation in an effort to understand the complex system of business relationships between various Internet entities (e.g., Autonomou...
155
click to vote
GLOBECOM
2006
IEEE
16 years 1 months ago
2006
IEEE
Abstract— Inferring AS-level end-to-end paths can be a valuable tool for both network operators and researchers. A widely known technique for inferring end-to-end paths is to per...