Sciweavers

769 search results - page 116 / 154
» Where Is the Proof
Sort
View
162
Voted
IJON
2006
131views more  IJON 2006»
15 years 3 months ago
Optimizing blind source separation with guided genetic algorithms
This paper proposes a novel method for blindly separating unobservable independent component (IC) signals based on the use of a genetic algorithm. It is intended for its applicati...
J. M. Górriz, Carlos García Puntonet...
133
Voted
JALC
2006
125views more  JALC 2006»
15 years 3 months ago
A Confinement Criterion for Securely Executing Mobile Code
Mobile programs, like applets, are not only ubiquitous, but also potentially malicious. We study the case where mobile programs are executed by a host system in a secured environm...
Hervé Grall
100
Voted
JSC
2008
58views more  JSC 2008»
15 years 3 months ago
A Groebner basis approach to solve a Conjecture of Nowicki
Let k be a field of characteristic zero, n any positive integer and let n be the derivation n i=1 Xi Yi of the polynomial ring k[X1, . . . , Xn, Y1, . . . , Yn] in 2n variables o...
Joseph Khoury
ENTCS
2007
100views more  ENTCS 2007»
15 years 3 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
117
Voted
MOR
2006
81views more  MOR 2006»
15 years 3 months ago
Simulated Annealing for Convex Optimization
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...
Adam Tauman Kalai, Santosh Vempala