Sciweavers

1581 search results - page 144 / 317
» Domain semantics of possibility computations
Sort
View
147
Voted
CIKM
2010
Springer
15 years 2 months ago
Domain-independent entity coreference in RDF graphs
In this paper, we present a novel entity coreference algorithm for Semantic Web instances. The key issues include how to locate context information and how to utilize the context ...
Dezhao Song, Jeff Heflin
112
Voted
ICPR
2000
IEEE
16 years 4 months ago
Acceleration of Thresholding and Labeling Operations through Geometric Processing of Gray-Level Images
This paper explores the utilization of adaptive triangular meshes representing gray-level images to accelerate basic image processing operations. In particular, two algorithms for...
Miguel Angel García, Boris Xavier Vintimill...
134
Voted
FCT
2009
Springer
15 years 10 months ago
On Random Betweenness Constraints
Despite of their applicability betweennness constraints have (to the author’s knowledge) hardly been considered from the random structures point of view. They are essentially diļ...
Andreas Goerdt
123
Voted
GECCO
2009
Springer
131views Optimization» more  GECCO 2009»
15 years 8 months ago
Application of a simple binary genetic algorithm to a noiseless testbed benchmark
One of the earliest evolutionary computation algorithms, the genetic algorithm, is applied to the noise-free BBOB 2009 testbed. It is adapted to the continuous domain by increasin...
Miguel Nicolau
100
Voted
SAC
2000
ACM
15 years 8 months ago
The GNU Prolog System and its Implementation
We describe in this paper the GNU-Prolog system, a free system consisting of a Prolog compiler and a constraint solver on finite domains. GNU-Prolog is based on a low-level mini-...
Daniel Diaz, Philippe Codognet