Sciweavers

1438 search results - page 220 / 288
» A general formalism for the analysis of distributed algorith...
Sort
View
ISCA
2011
IEEE
294views Hardware» more  ISCA 2011»
12 years 11 months ago
Moguls: a model to explore the memory hierarchy for bandwidth improvements
In recent years, the increasing number of processor cores and limited increases in main memory bandwidth have led to the problem of the bandwidth wall, where memory bandwidth is b...
Guangyu Sun, Christopher J. Hughes, Changkyu Kim, ...
BMCBI
2004
146views more  BMCBI 2004»
13 years 7 months ago
Multivariate search for differentially expressed gene combinations
Background: To identify differentially expressed genes, it is standard practice to test a twosample hypothesis for each gene with a proper adjustment for multiple testing. Such te...
Yuanhui Xiao, Robert D. Frisina, Alexander Gordon,...
GIS
2007
ACM
14 years 9 months ago
Evacuation route planning: scalable heuristics
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
Sangho Kim, Betsy George, Shashi Shekhar
STOC
2006
ACM
174views Algorithms» more  STOC 2006»
14 years 8 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
WPES
2003
ACM
14 years 1 months ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...