Sciweavers

1698 search results - page 255 / 340
» Growing Complex Games
Sort
View
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
14 years 11 months ago
Towards memoryless model building
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
David Iclanzan, Dumitru Dumitrescu
ICASSP
2010
IEEE
14 years 10 months ago
Shape matching based on graph alignment using hidden Markov models
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
Xiaoning Qian, Byung-Jun Yoon
ADT
2010
14 years 10 months ago
An EAP-EHash authentication method adapted to resource constrained terminals
: In the era of mobile and wireless networks, the growing complexity of end devices and the accentuated tendency towards miniaturization of them raise new security challenges. Auth...
Omar Cheikhrouhou, Maryline Laurent, Amin Ben Abda...
CII
2008
100views more  CII 2008»
14 years 10 months ago
Knowledge formalization in experience feedback processes: An ontology-based approach
Because of the current trend of integration and interoperability of industrial systems, their size and complexity continue to grow making it more difficult to analyze, to understa...
Bernard Kamsu Foguem, Thierry Coudert, C. Bé...
CORR
2010
Springer
99views Education» more  CORR 2010»
14 years 10 months ago
On Equivalence Between Network Topologies
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
Michelle Effros, Tracey Ho, Shirin Jalali