Sciweavers

2107 search results - page 266 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
DAC
2002
ACM
14 years 10 months ago
A solenoidal basis method for efficient inductance extraction
The ability to compute the parasitic inductance of the interconnect is critical to the timing verification of modern VLSI circuits. A challenging aspect of inductance extraction i...
Hemant Mahawar, Vivek Sarin, Weiping Shi
RECOMB
2008
Springer
14 years 9 months ago
Ancestral Reconstruction by Asymmetric Wagner Parsimony over Continuous Characters and Squared Parsimony over Distributions
Abstract. Contemporary inferences about evolution occasionally involve analyzing infinitely large feature spaces, requiring specific algorithmic techniques. We consider parsimony a...
Miklós Csürös
IMR
2003
Springer
14 years 2 months ago
Combined Laplacian and Optimization-based Smoothing for Quadratic Mixed Surface Meshes
Quadratic elements place stringent requirements on a surface mesh smoother. One of the biggest challenges is that a good linear element may become invalid when mid-side nodes are ...
Zhijian Chen, Joseph R. Tristano, Wa Kwok
CIKM
2006
Springer
14 years 28 days ago
3DString: a feature string kernel for 3D object classification on voxelized data
Classification of 3D objects remains an important task in many areas of data management such as engineering, medicine or biology. As a common preprocessing step in current approac...
Johannes Aßfalg, Karsten M. Borgwardt, Hans-...
IDA
2002
Springer
13 years 9 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel