Sciweavers

2127 search results - page 357 / 426
» Computing large matchings fast
Sort
View
115
Voted
SGP
2007
15 years 6 months ago
Dynamic geometry registration
We propose an algorithm that performs registration of large sets of unstructured point clouds of moving and deforming objects without computing correspondences. Given as input a s...
Niloy J. Mitra, Simon Flöry, Maks Ovsjanikov,...
145
Voted
FCCM
2005
IEEE
139views VLSI» more  FCCM 2005»
15 years 9 months ago
A Study of the Scalability of On-Chip Routing for Just-in-Time FPGA Compilation
Just-in-time (JIT) compilation has been used in many applications to enable standard software binaries to execute on different underlying processor architectures. We previously in...
Roman L. Lysecky, Frank Vahid, Sheldon X.-D. Tan
113
Voted
DAC
2002
ACM
16 years 4 months ago
ILP-based engineering change
We have developed a generic integer linear programming(ILP)based engineering change(EC) methodology. The EC methodology has three components: enabling, fast, and preserving. Enabl...
Farinaz Koushanfar, Jennifer L. Wong, Jessica Feng...
124
Voted
FAST
2007
15 years 5 months ago
Disk Failures in the Real World: What Does an MTTF of 1, 000, 000 Hours Mean to You?
Component failure in large-scale IT installations is becoming an ever larger problem as the number of components in a single cluster approaches a million. In this paper, we presen...
Bianca Schroeder, Garth A. Gibson
146
Voted
BMCBI
2010
113views more  BMCBI 2010»
15 years 3 months ago
ProbABEL package for genome-wide association analysis of imputed data
Background: Over the last few years, genome-wide association (GWA) studies became a tool of choice for the identification of loci associated with complex traits. Currently, impute...
Yurii S. Aulchenko, Maksim V. Struchalin, Cornelia...