Sciweavers

836 search results - page 91 / 168
» On the Complexity of Train Assignment Problems
Sort
View
TNN
2008
182views more  TNN 2008»
15 years 3 months ago
Large-Scale Maximum Margin Discriminant Analysis Using Core Vector Machines
Abstract--Large-margin methods, such as support vector machines (SVMs), have been very successful in classification problems. Recently, maximum margin discriminant analysis (MMDA) ...
Ivor Wai-Hung Tsang, András Kocsor, James T...
PAMI
2007
193views more  PAMI 2007»
15 years 3 months ago
Robust Object Recognition with Cortex-Like Mechanisms
—We introduce a new general framework for the recognition of complex visual scenes, which is motivated by biology: We describe a hierarchical system that closely follows the orga...
Thomas Serre, Lior Wolf, Stanley M. Bileschi, Maxi...
138
Voted
ICDCS
2009
IEEE
16 years 1 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
ICC
2007
IEEE
119views Communications» more  ICC 2007»
15 years 10 months ago
Spatio-Temporal Dynamic Spectrum Allocation with Interference Handling
— As for today, radio spectrum resource is rigidly partitioned for dedicated purposes. The exclusive license of fixed size spectrum blocks separated by guard bands easily solves...
László Kovacs, Attila Vidács,...
GECCO
2003
Springer
153views Optimization» more  GECCO 2003»
15 years 9 months ago
SEPA: Structure Evolution and Parameter Adaptation in Feed-Forward Neural Networks
Abstract. In developing algorithms that dynamically changes the structure and weights of ANN (Artificial Neural Networks), there must be a proper balance between network complexit...
Paulito P. Palmes, Taichi Hayasaka, Shiro Usui