Sciweavers

400 search results - page 61 / 80
» An Algorithm for the Reduction of Linear DAE
Sort
View
DATE
2008
IEEE
138views Hardware» more  DATE 2008»
14 years 3 months ago
Dynamic Task Allocation Strategies in MPSoC for Soft Real-time Applications
This work evaluates task allocation strategies based on bin-packing algorithms in the context of multiprocessor systems-on-chip (MPSoCs) with task migration capabilities, running ...
Eduardo Wenzel Brião, Daniel Barcelos, Fl&a...
CIKM
2008
Springer
13 years 10 months ago
REDUS: finding reducible subspaces in high dimensional data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. The most well known approaches for high dimensional data analysis are...
Xiang Zhang, Feng Pan, Wei Wang 0010
MP
2010
135views more  MP 2010»
13 years 7 months ago
An inexact Newton method for nonconvex equality constrained optimization
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
DAC
2009
ACM
14 years 9 months ago
ILP-based pin-count aware design methodology for microfluidic biochips
Digital microfluidic biochips have emerged as a popular alternative for laboratory experiments. To make the biochip feasible for practical applications, pin-count reduction is a k...
Cliff Chiung-Yu Lin, Yao-Wen Chang
BMCBI
2006
202views more  BMCBI 2006»
13 years 8 months ago
Spectral embedding finds meaningful (relevant) structure in image and microarray data
Background: Accurate methods for extraction of meaningful patterns in high dimensional data have become increasingly important with the recent generation of data types containing ...
Brandon W. Higgs, Jennifer W. Weller, Jeffrey L. S...