Sciweavers

3757 search results - page 382 / 752
» The overlap number of a graph
Sort
View
SIGSOFT
2009
ACM
16 years 7 months ago
Improving bug triage with bug tossing graphs
A bug report is typically assigned to a single developer who is then responsible for fixing the bug. In Mozilla and Eclipse, between 37%-44% of bug reports are "tossed" ...
Gaeul Jeong, Sunghun Kim, Thomas Zimmermann
RECOMB
2010
Springer
16 years 1 months ago
Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
Barna Saha, Allison Hoch, Samir Khuller, Louiqa Ra...
WADS
2009
Springer
232views Algorithms» more  WADS 2009»
16 years 1 months ago
On Making Directed Graphs Transitive
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
Mathias Weller, Christian Komusiewicz, Rolf Nieder...
INFOCOM
2008
IEEE
16 years 1 months ago
Swarming on Optimized Graphs for n-Way Broadcast
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
Georgios Smaragdakis, Azer Bestavros, Nikolaos Lao...
CODES
2005
IEEE
16 years 12 days ago
Shift buffering technique for automatic code synthesis from synchronous dataflow graphs
This paper proposes a new efficient buffer management technique called shift buffering for automatic code synthesis from synchronous dataflow graphs (SDF). Two previous buffer man...
Hyunok Oh, Nikil D. Dutt, Soonhoi Ha