Sciweavers

243 search results - page 30 / 49
» Solution of moving-boundary problems by the spectral element...
Sort
View
ANTS
2004
Springer
233views Algorithms» more  ANTS 2004»
15 years 3 months ago
Computing Order Statistics in the Farey Sequence
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
Corina E. Patrascu, Mihai Patrascu
ICASSP
2011
IEEE
14 years 1 months ago
Maximum a posteriori based regularization parameter selection
The 1 norm regularized least square technique has been proposed as an efficient method to calculate sparse solutions. However, the choice of the regularization parameter is still...
Ashkan Panahi, Mats Viberg
CEC
2007
IEEE
15 years 4 months ago
An investigation of hyper-heuristic search spaces
— Hyper-heuristics or “heuristics that coordinate heuristics” are fastly becoming popular for solving combinatorial optimisation problems. These methods do not search directl...
José Antonio Vázquez Rodrígue...
ML
2010
ACM
193views Machine Learning» more  ML 2010»
14 years 4 months ago
On the eigenvectors of p-Laplacian
Spectral analysis approaches have been actively studied in machine learning and data mining areas, due to their generality, efficiency, and rich theoretical foundations. As a natur...
Dijun Luo, Heng Huang, Chris H. Q. Ding, Feiping N...
CVPR
2005
IEEE
15 years 11 months ago
Modeling Dynamic Scenes with Active Appearance
In this work we propose a model for video scenes that contain temporal variability in shape and appearance. We propose a conditionally linear model akin to a dynamic extension of ...
Gianfranco Doretto