Sciweavers

16430 search results - page 2954 / 3286
» On Computable Tree Functions
Sort
View
149
Voted
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 6 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
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 6 months ago
Virtual screening with support vector machines and structure kernels
Support vector machines and kernel methods have recently gained considerable attention in chemoinformatics. They offer generally good performance for problems of supervised classi...
Pierre Mahé, Jean-Philippe Vert
JDA
2008
72views more  JDA 2008»
15 years 6 months ago
Semi-local longest common subsequences in subquadratic time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
Alexander Tiskin
IPL
2006
89views more  IPL 2006»
15 years 6 months ago
Adaptive general perfectly periodic scheduling
We propose an adaptive algorithm Adaptmin to create perfectly periodic schedules. A perfectly periodic schedule schedules a client regularly after a predefined amount of time known...
Shailesh Patil, Vijay K. Garg
CPHYSICS
2007
86views more  CPHYSICS 2007»
15 years 6 months ago
Are polymer melts "ideal"
It is commonly accepted that in concentrated solutions or melts high-molecular weight polymers display randomwalk conformational properties without long-range correlations between...
Joachim Paul Jakob Wittmer, Philippe Beckrich, F. ...
« Prev « First page 2954 / 3286 Last » Next »