Sciweavers

663 search results - page 90 / 133
» Applying Two New Methods to the Teaching of Computer Archite...
Sort
View
GRC
2010
IEEE
13 years 10 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi
DAC
2012
ACM
11 years 11 months ago
GDRouter: interleaved global routing and detailed routing for ultimate routability
Improving detailed routing routability is an important objective of a global router. In this paper, we propose GDRouter, an interleaved global routing and detailed routing algorit...
Yanheng Zhang, Chris Chu
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
14 years 3 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
RECOMB
2005
Springer
14 years 9 months ago
Improved Recombination Lower Bounds for Haplotype Data
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
Vineet Bafna, Vikas Bansal
CF
2005
ACM
13 years 11 months ago
Evaluation of extended dictionary-based static code compression schemes
This paper evaluates how much extended dictionary-based code compression techniques can reduce the static code size. In their simplest form, such methods statically identify ident...
Martin Thuresson, Per Stenström