356 search results - page 42 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
122
click to vote
APVIS
2006
15 years 1 months ago
2006
The complexity and size of data is rapidly increasing in modern science, business and engineering. This has resulted in increasing demands for more sophisticated data analysis met...
93
Voted
NIPS
2004
15 years 1 months ago
2004
The computation of classical higher-order statistics such as higher-order moments or spectra is difficult for images due to the huge number of terms to be estimated and interprete...
INFOCOM
2002
IEEE
15 years 5 months ago
2002
IEEE
— Recently, a class of solutions including Core-Stateless Fair Queueing (CSFQ), Rainbow Fair Queueing, and Diffserv have been proposed to address the scalability concerns that ha...
108
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...