2107 search results - page 217 / 422 » Computing Small Search Numbers in Linear Time |
127
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
155
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
160
click to vote
ICPP
2009
IEEE
15 years 10 months ago
2009
IEEE
—Clusters and applications continue to grow in size while their mean time between failure (MTBF) is getting smaller. Checkpoint/Restart is becoming increasingly important for lar...
112
click to vote
ISBI
2008
IEEE
16 years 4 months ago
2008
IEEE
GRAPPA is one of the predominant methods used to reconstruct accelerated parallel MRI data. In has been shown previously that spatially varying the GRAPPA reconstruction coefficie...
188
click to vote
ISMB
2008
15 years 6 months ago
2008
Motivation: Array-based comparative genomic hybridization (arrayCGH) has recently become a popular tool to identify DNA copy number variations along the genome. These profiles are...