Sciweavers

21108 search results - page 310 / 4222
» A General Class of Models of
Sort
View
PAMI
2007
154views more  PAMI 2007»
15 years 6 months ago
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
BC
2008
72views more  BC 2008»
15 years 6 months ago
Spike-train spectra and network response functions for non-linear integrate-and-fire neurons
Reduced models have long been used as a tool for the analysis of the complex activity taking place in neurons and their coupled networks. Recent advanced in experimental and theore...
Magnus J. E. Richardson
LCTRTS
2007
Springer
16 years 26 days ago
Generalizing parametric timing analysis
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...
Joel Coffman, Christopher A. Healy, Frank Mueller,...
LION
2007
Springer
198views Optimization» more  LION 2007»
16 years 26 days ago
Multiobjective Landscape Analysis and the Generalized Assignment Problem
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...
Deon Garrett, Dipankar Dasgupta
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
15 years 8 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson