6409 search results - page 271 / 1282 » A Computational Algorithm for Origami Design |
163
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
180
click to vote
TPDS
2008
15 years 6 months ago
2008
Abstract-- With increasing richness in features such as personalization of content, web applications are becoming more complex and hence compute intensive. Traditional approaches t...
173
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
195
click to vote
ICS
2004
Tsinghua U.
15 years 12 months ago
2004
Tsinghua U.
We propose a novel replacement algorithm, called InterReference Gap Distribution Replacement (IGDR), for setassociative secondary caches of processors. IGDR attaches a weight to e...
185
click to vote
ESA
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...