Sciweavers

3133 search results - page 283 / 627
» Representing clusters for retrieval
Sort
View
IRAL
2003
ACM
16 years 13 hour ago
Extraction of user preferences from a few positive documents
In this work, we propose a new method for extracting user preferences from a few documents that might interest users. For this end, we first extract candidate terms and choose a n...
Byeong Man Kim, Qing Li, Jong-Wan Kim
ICDE
2006
IEEE
146views Database» more  ICDE 2006»
16 years 8 months ago
Using XML to Build Efficient Transaction-Time Temporal Database Systems on Relational Databases
In this paper, we present the ArchIS system that achieves full-functionality transaction-time databases without requiring temporal extensions in XML or database standards. ArchIS&...
Fusheng Wang, Xin Zhou, Carlo Zaniolo
WWW
2007
ACM
16 years 7 months ago
On building graphs of documents with artificial ants
We present an incremental algorithm for building a neighborhood graph from a set of documents. This algorithm is based on a population of artificial agents that imitate the way re...
Hanane Azzag, Julien Lavergne, Christiane Guinot, ...
GBRPR
2009
Springer
16 years 1 months ago
Graph Matching Based on Node Signatures
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...
Salim Jouili, Salvatore Tabbone
JCDL
2006
ACM
152views Education» more  JCDL 2006»
16 years 22 days ago
Also by the same author: AKTiveAuthor, a citation graph approach to name disambiguation
The desire for definitive data and the semantic web drive for inference over heterogeneous data sources requires co-reference resolution to be performed on those data. In particul...
Duncan M. McRae-Spencer, Nigel R. Shadbolt