Sciweavers

43 search results - page 5 / 9
» Mixed Mode Matrix Multiplication
Sort
View
68
Voted
JACM
2000
119views more  JACM 2000»
14 years 9 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
CVPR
2011
IEEE
14 years 1 months ago
Support Tucker Machines
In this paper we address the two-class classification problem within the tensor-based framework, by formulating the Support Tucker Machines (STuMs). More precisely, in the propos...
Irene Kotsia, Ioannis Patras
EVOW
2005
Springer
15 years 3 months ago
Order Preserving Clustering over Multiple Time Course Experiments
Abstract. Clustering still represents the most commonly used technique to analyze gene expression data—be it classical clustering approaches that aim at finding biologically rel...
Stefan Bleuler, Eckart Zitzler
WEA
2010
Springer
241views Algorithms» more  WEA 2010»
15 years 4 months ago
A Branch-and-Price Algorithm for Multi-mode Resource Leveling
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
Eamonn T. Coughlan, Marco E. Lübbecke, Jens S...
ISCAS
2006
IEEE
107views Hardware» more  ISCAS 2006»
15 years 3 months ago
A versatile computation module for adaptable multimedia processors
—This paper describes a low cost, low power, versatile computation module that can be used as a coarse-grain building block in multimedia processors. The module, which has a data...
Yunan Xiang, R. Pettibon, Martin Margala