Sciweavers

7913 search results - page 464 / 1583
» Information Collection on a Graph
Sort
View
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
16 years 6 months ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...
130
Voted
ICPR
2002
IEEE
16 years 6 months ago
Shape Representation Using Concavity Graphs
In this paper, a new graph data structure for 2-D shape representation is proposed. The new structure is called a concavity graph, and is an evolution from the already known "...
Ossama El Badawy, Mohamed Kamel
ICML
2005
IEEE
16 years 5 months ago
Optimal assignment kernels for attributed molecular graphs
We propose a new kernel function for attributed molecular graphs, which is based on the idea of computing an optimal assignment from the atoms of one molecule to those of another ...
Andreas Zell, Florian Sieker, Holger Fröhlich...
126
Voted
ICC
2008
IEEE
15 years 11 months ago
Normal Graphs for Downlink Multiuser MIMO Scheduling
—Inspired by the success of the low-density parity-check (LDPC) codes in the field of error-control coding, in this paper we propose transforming the downlink multiuser multiple-...
Jung-Chieh Chen, Cheng-Hsuan Wu, Chao-Kai Wen, Yao...
PDCAT
2007
Springer
15 years 11 months ago
Optimal Routing in Binomial Graph Networks
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
Thara Angskun, George Bosilca, Bradley T. Vander Z...