7015 search results - page 1362 / 1403 » Approximation algorithms for co-clustering |
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—Continuous growth in network link rates poses a strong demand on high speed IP lookup engines. While Ternary Content Addressable Memory (TCAM) based solutions serve most of toda...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
MICRO
2008
IEEE
14 years 3 months ago
2008
IEEE
Shrinking transistor sizes and a trend toward low-power processors have caused increased leakage, high per-device variation and a larger number of hard and soft errors. Maintainin...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...