Sciweavers

1224 search results - page 55 / 245
» Concept Search
Sort
View
SAT
2007
Springer
96views Hardware» more  SAT 2007»
14 years 4 months ago
From Idempotent Generalized Boolean Assignments to Multi-bit Search
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...
Marijn Heule, Hans van Maaren
AISB
1995
Springer
14 years 1 months ago
The Ant Colony Metaphor for Searching Continuous Design Spaces
This paper describes a form of dynamical computational system--4he ant colony---and presents an ant colony model for continuous space optimisation problems. The ant colony metapho...
George Bilchev, Ian C. Parmee
ECIR
2006
Springer
13 years 11 months ago
Improving Quality of Search Results Clustering with Approximate Matrix Factorisations
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...
Stanislaw Osinski
SECO
2010
13 years 5 months ago
Towards an Ontological Representation of Services in Search Computing
In the Search Computing project, Web services are modeled by the Semantic Resource Framework (SRF). In this article, we argue that the SRF could benefit from ontological concepts b...
Fabian M. Suchanek, Alessandro Bozzon, Emanuele De...
ICDE
2008
IEEE
162views Database» more  ICDE 2008»
14 years 11 months ago
Adaptive Approximate Similarity Searching through Metric Social Networks
Exploiting the concepts of social networking represents a novel approach to the approximate similarity query processing. We present a metric social network where relations between...
Jan Sedmidubský, Pavel Zezula, Stanislav Ba...