Sciweavers

721 search results - page 59 / 145
» Graphs with Large Obstacle Numbers
Sort
View
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 9 months ago
Mobile call graphs: beyond power-law and lognormal distributions
We analyze a massive social network, gathered from the records of a large mobile phone operator, with more than a million users and tens of millions of calls. We examine the distr...
Mukund Seshadri, Sridhar Machiraju, Ashwin Sridhar...
CIKM
2009
Springer
14 years 3 months ago
Independent informative subgraph mining for graph information retrieval
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
14 years 9 months ago
Identifying non-actionable association rules
Building predictive models and finding useful rules are two important tasks of data mining. While building predictive models has been well studied, finding useful rules for action...
Bing Liu, Wynne Hsu, Yiming Ma
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 9 months ago
PicShark: mitigating metadata scarcity through large-scale P2P collaboration
With the commoditization of digital devices, personal information and media sharing is becoming a key application on the pervasive Web. In such a context, data annotation rather th...
Philippe Cudré-Mauroux, Adriana Budura, Manfred H...
CGO
2010
IEEE
14 years 4 months ago
Parameterized tiling revisited
Tiling, a key transformation for optimizing programs, has been widely studied in literature. Parameterized tiled code is important for auto-tuning systems since they often execute...
Muthu Manikandan Baskaran, Albert Hartono, Sanket ...