Sciweavers

243 search results - page 21 / 49
» On randomized representations of graphs using short labels
Sort
View
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
13 years 11 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
SCALESPACE
2005
Springer
14 years 25 days ago
Discrete Representation of Top Points via Scale Space Tessellation
In previous work, singular points (or top points) in the scale space representation of generic images have proven valuable for image matching. In this paper, we propose a construct...
Bram Platel, M. Fatih Demirci, Ali Shokoufandeh, L...
FLAIRS
2006
13 years 8 months ago
Inexact Graph Matching: A Case of Study
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
Ivan Olmos, Jesus A. Gonzalez, Mauricio Osorio
ICCS
2003
Springer
14 years 17 days ago
Representing Time and Modality in Narratives with Conceptual Graphs
In this paper we investigate principles of the representation of time and modality in terms of conceptual graphs. Based on the works of A. N. Prior, and C. S. Peirce, we suggest a ...
Henrik Schärfe, Peter Øhrstrøm
ISBI
2008
IEEE
14 years 8 months ago
Investigating implicit shape representations for alignment of livers from serial CT examinations
In this paper, we examine the use of implicit shape representations for nonrigid registration of serial CT liver examinations. Using ground truth in the form of corresponding land...
Nathan D. Cahill, Grace Vesom, Lena Gorelick, Joan...