Sciweavers

6045 search results - page 165 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
14 years 8 months ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal
IMCSIT
2010
13 years 5 months ago
Solving a Kind of BVP for ODEs on heterogeneous CPU + CUDA-enabled GPU Systems
The aim of this paper is to show that a special kind of boundary value problem for second-order ordinary differential equations which reduces to the problem of solving a tridiagona...
Przemyslaw Stpiczynski, Joanna Potiopa
MA
2010
Springer
94views Communications» more  MA 2010»
13 years 6 months ago
On sparse estimation for semiparametric linear transformation models
: Semiparametric linear transformation models have received much attention due to its high flexibility in modeling survival data. A useful estimating equation procedure was recent...
Hao Helen Zhang, Wenbin Lu, Hansheng Wang
ICCAD
2006
IEEE
152views Hardware» more  ICCAD 2006»
14 years 5 months ago
Fast and robust quadratic placement combined with an exact linear net model
— This paper presents a robust quadratic placement approach, which offers both high-quality placements and excellent computational efficiency. The additional force which distrib...
Peter Spindler, Frank M. Johannes
JMLR
2012
11 years 10 months ago
Metric and Kernel Learning Using a Linear Transformation
Metric and kernel learning arise in several machine learning applications. However, most existing metric learning algorithms are limited to learning metrics over low-dimensional d...
Prateek Jain, Brian Kulis, Jason V. Davis, Inderji...