Sciweavers

821 search results - page 51 / 165
» Addressing the Petersen graph
Sort
View
ICDM
2007
IEEE
156views Data Mining» more  ICDM 2007»
15 years 3 months ago
Computing Correlation Anomaly Scores Using Stochastic Nearest Neighbors
This paper addresses the task of change analysis of correlated multi-sensor systems. The goal of change analysis is to compute the anomaly score of each sensor when we know that t...
Tsuyoshi Idé, Spiros Papadimitriou, Michail...
BMVC
2000
15 years 1 months ago
Region-Based Object Recognition: Pruning Multiple Representations and Hypotheses
We address the problem of object recognition in computer vision. We represent each model and the scene in the form of Attributed Relational Graph. A multiple region representation...
Alireza Ahmadyfard, Josef Kittler
TCS
2008
14 years 11 months ago
Succinct representations of planar maps
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
Luca Castelli Aleardi, Olivier Devillers, Gilles S...
WIOPT
2010
IEEE
14 years 10 months ago
K-shell decomposition for dynamic complex networks
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
Daniele Miorandi, Francesco De Pellegrini
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 2 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu