Sciweavers

5606 search results - page 486 / 1122
» Randomization Techniques for Graphs.
Sort
View
TSE
2008
113views more  TSE 2008»
15 years 6 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
171
Voted
BMCBI
2004
120views more  BMCBI 2004»
15 years 6 months ago
Clustering under the line graph transformation: application to reaction network
Background: Many real networks can be understood as two complementary networks with two kind of nodes. This is the case of metabolic networks where the first network has chemical ...
Jose C. Nacher, Nobuhisa Ueda, Takuji Yamada, Mino...
ASUNAM
2011
IEEE
14 years 6 months ago
Visualizing Bibliographic Databases as Graphs and Mining Potential Research Synergies
—Bibliographic databases are a prosperous field for data mining research and social network analysis. They contain rich information, which can be analyzed across different dimen...
Iraklis Varlamis, George Tsatsaronis
CVPR
2012
IEEE
13 years 9 months ago
Segmentation using superpixels: A bipartite graph partitioning approach
Grouping cues can affect the performance of segmentation greatly. In this paper, we show that superpixels (image segments) can provide powerful grouping cues to guide segmentation...
Zhenguo Li, Xiao-Ming Wu, Shih-Fu Chang
4OR
2007
103views more  4OR 2007»
15 years 7 months ago
Compact linearization for binary quadratic problems
Abstract We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer...
Leo Liberti