Sciweavers

4403 search results - page 534 / 881
» Galois Theory of Algorithms
Sort
View
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
15 years 7 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 7 months ago
Dendritic Cells for Anomaly Detection
Artificial immune systems, more specifically the negative selection algorithm, have previously been applied to intrusion detection. The aim of this research is to develop an intrus...
Julie Greensmith, Jamie Twycross, Uwe Aickelin
IJHPCA
2006
99views more  IJHPCA 2006»
15 years 7 months ago
A Pragmatic Analysis Of Scheduling Environments On New Computing Platforms
Today, large scale parallel systems are available at relatively low cost. Many powerful such systems have been installed all over the world and the number of users is always incre...
Lionel Eyraud
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 7 months ago
On formulas for decoding binary cyclic codes
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
Daniel Augot, Magali Bardet, Jean-Charles Faug&egr...
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 7 months ago
Separable convex optimization problems with linear ascending constraints
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
Arun Padakandla, Rajesh Sundaresan