Sciweavers

5075 search results - page 345 / 1015
» Convergence
Sort
View
NIPS
2007
15 years 8 months ago
Random Features for Large-Scale Kernel Machines
To accelerate the training of kernel machines, we propose to map the input data to a randomized low-dimensional feature space and then apply existing fast linear methods. The feat...
Ali Rahimi, Benjamin Recht
SE
2007
15 years 8 months ago
Enhancing the UML with shadows for agile development
Agile methodologies can be enhanced by the use of shadows as this feature because of its inherent ability to dynamically change the behavior of classes and objects, provides mecha...
Marc Conrad, Marianne Huchard
AAAI
2006
15 years 8 months ago
A New Approach to Estimating the Expected First Hitting Time of Evolutionary Algorithms
The expected first hitting time is an important issue in theoretical analyses of evolutionary algorithms since it implies the average computational time complexity. In this paper,...
Yang Yu, Zhi-Hua Zhou
ACID
2006
298views Algorithms» more  ACID 2006»
15 years 8 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
CCCG
2006
15 years 8 months ago
Tight Bounds for Point Recolouring
In their paper on delineating boundaries from geographic data, Reinbacher et al. [9] use a recolouring method to reclassify points so that the boundaries that separate points of d...
Yurai Núñez Rodríguez, David ...