1402 search results - page 256 / 281 » Sparse-Memory Graph Search |
ICTAI
1993
IEEE
15 years 1 months ago
1993
IEEE
The guidar project aims to support the complete activity of Graphical User Interface Development And Reuse. We propose to organize the system as a collaborative architecture of in...
EVOW
2010
Springer
15 years 1 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
101
click to vote
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
JCDL
2010
ACM
14 years 11 months ago
2010
ACM
We present a new algorithm to measure domain-specific readability. It iteratively computes the readability of domainspecific resources based on the difficulty of domain-specific c...
CIVR
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we propose a novel Markov model-based formulation for the image annotation problem. In this formulation, we treat image annotation as a graph ranking problem, by de...