Sciweavers

95 search results - page 4 / 19
» General neighbour-distinguishing index of a graph
Sort
View
TKDE
2002
133views more  TKDE 2002»
13 years 7 months ago
ImageMap: An Image Indexing Method Based on Spatial Similarity
We introduce ImageMap, as a method for indexing and similarity searching in Image DataBases (IDBs). ImageMap answers "queries by example", involving any number of object...
Euripides G. M. Petrakis, Christos Faloutsos, King...
INFOCOM
2012
IEEE
11 years 10 months ago
Dynamic index coding for wireless broadcast networks
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
Michael J. Neely, Arash Saber Tehrani, Zhen Zhang
PVLDB
2008
108views more  PVLDB 2008»
13 years 7 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
SIGMOD
2011
ACM
230views Database» more  SIGMOD 2011»
12 years 10 months ago
GBLENDER: visual subgraph query formulation meets query processing
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, By...
SPIRE
2005
Springer
14 years 1 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez