Sciweavers

5063 search results - page 576 / 1013
» Personalized Data Set for Analysis
Sort
View
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 7 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
16 years 7 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
IJMMS
2007
91views more  IJMMS 2007»
15 years 6 months ago
Mining communities and their relationships in blogs: A study of online hate groups
Blogs, often treated as the equivalence of online personal diaries, have become one of the fastest growing types of Web-based media. Everyone is free to express their opinions and...
Michael Chau, Jennifer Jie Xu
CSUR
1999
159views more  CSUR 1999»
15 years 6 months ago
Hubs, authorities, and communities
The Web can be naturally modeled as a directed graph, consisting of a set of abstract nodes (the pages) joined by directional edges (the hyperlinks). Hyperlinks encode a considerab...
Jon M. Kleinberg
OOPSLA
2010
Springer
15 years 5 months ago
An input-centric paradigm for program dynamic optimizations
Accurately predicting program behaviors (e.g., locality, dependency, method calling frequency) is fundamental for program optimizations and runtime adaptations. Despite decades of...
Kai Tian, Yunlian Jiang, Eddy Z. Zhang, Xipeng She...