Sciweavers

215 search results - page 38 / 43
» On the number of factorizations of a full cycle
Sort
View
HPCA
2007
IEEE
14 years 7 months ago
A Low Overhead Fault Tolerant Coherence Protocol for CMP Architectures
It is widely accepted that transient failures will appear more frequently in chips designed in the near future due to several factors such as the increased integration scale. On t...
Ricardo Fernández Pascual, José M. G...
STOC
2006
ACM
174views Algorithms» more  STOC 2006»
14 years 7 months ago
Edge-disjoint paths in Planar graphs with constant congestion
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
MOBIHOC
2003
ACM
14 years 7 months ago
On the capacity improvement of ad hoc wireless networks using directional antennas
The capacity of ad hoc wireless networks is constrained by the interference between concurrent transmissions from neighboring nodes. Gupta and Kumar have shown that the capacity o...
Su Yi, Yong Pei, Shivkumar Kalyanaraman
WSDM
2010
ACM
236views Data Mining» more  WSDM 2010»
14 years 4 months ago
Personalized Click Prediction in Sponsored Search
Sponsored search is a multi-billion dollar business that generates most of the revenue for search engines. Predicting the probability that users click on ads is crucial to sponsor...
Erick Cantú-Paz, Haibin Cheng
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
14 years 2 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert