Sciweavers

721 search results - page 45 / 145
» Graphs with Large Obstacle Numbers
Sort
View
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
14 years 9 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
JCP
2008
116views more  JCP 2008»
13 years 9 months ago
Sensor Location Strategy in Large-Scale Systems for Fault Detection Applications
Fault detection in large-scale systems is conducted by the use of sensors, thus the sensor location influences the performances of fault detection directly. As the scale of systems...
Fan Yang, Deyun Xiao
ICML
2004
IEEE
14 years 2 months ago
Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
Hisashi Kashima, Yuta Tsuboi
APPROX
2006
Springer
117views Algorithms» more  APPROX 2006»
14 years 1 months ago
Fractional Matching Via Balls-and-Bins
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
Rajeev Motwani, Rina Panigrahy, Ying Xu 0002
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 9 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang