417 search results - page 21 / 84 » Some Theory for Generalized Boosting Algorithms |
WD
2010
13 years 6 months ago
2010
The use of topological features, more specifically, the importance of an element related to its structural position is a subject widely studied. For instance, complex networks theo...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
PODC
2009
ACM
14 years 9 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
MOC
2002
13 years 8 months ago
2002
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...