Sciweavers

6315 search results - page 301 / 1263
» Approximating Solution Structure
Sort
View
ISCA
2010
IEEE
214views Hardware» more  ISCA 2010»
15 years 11 months ago
Re-architecting DRAM memory systems with monolithically integrated silicon photonics
The performance of future manycore processors will only scale with the number of integrated cores if there is a corresponding increase in memory bandwidth. Projected scaling of el...
Scott Beamer, Chen Sun, Yong-Jin Kwon, Ajay Joshi,...
GG
2008
Springer
15 years 7 months ago
Transformation-Based Operationalization of Graph Languages
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
Erhard Weinell
ECCV
2006
Springer
16 years 8 months ago
EMD-L1: An Efficient and Robust Algorithm for Comparing Histogram-Based Descriptors
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
Haibin Ling, Kazunori Okada
CPM
2004
Springer
168views Combinatorics» more  CPM 2004»
16 years 2 days ago
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robe...
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 7 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy