Sciweavers

6 search results - page 1 / 2
» A Tight Analysis of the Maximal Matching Heuristic
Sort
View
COCOON
2005
Springer
13 years 10 months ago
A Tight Analysis of the Maximal Matching Heuristic
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
Jean Cardinal, Martine Labbé, Stefan Langer...
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 5 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
DAGSTUHL
2006
13 years 6 months ago
Point-set algorithms for pattern discovery and pattern matching in music
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
David Meredith
CC
2005
Springer
123views System Software» more  CC 2005»
13 years 10 months ago
XML Goes Native: Run-Time Representations for Xtatic
Abstract. Xtatic is a lightweight extension of C offering native support for statically typed XML processing. XML trees are built-in values in Xtatic, and static analysis of the t...
Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pi...
TSE
2008
113views more  TSE 2008»
13 years 4 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