234 search results - page 43 / 47 » Rademacher Margin Complexity |
97
Voted
ISCA
2005
IEEE
15 years 3 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
DAC
2007
ACM
15 years 10 months ago
2007
ACM
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
DAC
2007
ACM
15 years 10 months ago
2007
ACM
Negative bias temperature instability (NBTI) in MOSFETs is one of the major reliability challenges in nano-scale technology. This paper presents an efficient technique to characte...
WWW
2009
ACM
15 years 10 months ago
2009
ACM
Contextual advertising (also called content match) refers to the placement of small textual ads within the content of a generic web page. It has become a significant source of rev...
106
click to vote
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...