Sciweavers

361 search results - page 26 / 73
» Algorithms for Extracting Timeliness Graphs
Sort
View
TSE
2008
113views more  TSE 2008»
13 years 8 months ago
Discovering Neglected Conditions in Software by Mining Dependence Graphs
Neglected conditions are an important but difficult-to-find class of software defects. This paper presents a novel approach for revealing neglected conditions that integrates stati...
Ray-Yaung Chang, Andy Podgurski, Jiong Yang
CASES
2009
ACM
14 years 3 months ago
Optimal loop parallelization for maximizing iteration-level parallelism
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
Duo Liu, Zili Shao, Meng Wang, Minyi Guo, Jingling...
ACL
2006
13 years 10 months ago
Creating a CCGbank and a Wide-Coverage CCG Lexicon for German
We present an algorithm which creates a German CCGbank by translating the syntax graphs in the German Tiger corpus into CCG derivation trees. The resulting corpus contains 46,628 ...
Julia Hockenmaier
KDD
2001
ACM
262views Data Mining» more  KDD 2001»
14 years 9 months ago
LOGML: Log Markup Language for Web Usage Mining
Web Usage Mining refers to the discovery of interesting information from user navigational behavior as stored in web access logs. While extracting simple information from web logs...
John R. Punin, Mukkai S. Krishnamoorthy, Mohammed ...
CIKM
2010
Springer
13 years 3 months ago
Mining networks with shared items
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
Jun Sese, Mio Seki, Mutsumi Fukuzaki