Sciweavers

5390 search results - page 913 / 1078
» Support cluster machine
Sort
View
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 8 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
CAIP
2009
Springer
210views Image Analysis» more  CAIP 2009»
15 years 8 months ago
Shape Classification Using a Flexible Graph Kernel
The medial axis being an homotopic transformation, the skeleton of a 2D shape corresponds to a planar graph having one face for each hole of the shape and one node for each junctio...
François-Xavier Dupé, Luc Brun
INCDM
2010
Springer
146views Data Mining» more  INCDM 2010»
15 years 8 months ago
Learning from Humanoid Cartoon Designs
Abstract. Character design is a key ingredient to the success of any comicbook, graphic novel, or animated feature. Artists typically use shape, size and proportion as the first de...
Md. Tanvirul Islam, Kaiser Md. Nahiduzzaman, Why Y...
CEC
2007
IEEE
15 years 8 months ago
Solving, rating and generating Sudoku puzzles with GA
This paper studies the problems involved in solving, rating and generating Sudoku puzzles with genetic algorithms (GA). Sudoku is a number puzzle that has recently become a worldwi...
Timo Mantere, Janne Koljonen
CIDM
2007
IEEE
15 years 8 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...