Sciweavers

2424 search results - page 115 / 485
» A general algorithm for data dependence analysis
Sort
View
MABS
2004
Springer
15 years 8 months ago
Formal Analysis of Meeting Protocols
Organizations depend on regular meetings to carry out their everyday tasks. When carried out successfully, meetings offer a common medium for participants to exchange ideas and mak...
Catholijn M. Jonker, Martijn C. Schut, Jan Treur, ...
IWCIA
2009
Springer
15 years 9 months ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...
SIGSOFT
1994
ACM
15 years 7 months ago
Speeding up Slicing
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genev...
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 8 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
119
Voted
BMCBI
2010
136views more  BMCBI 2010»
15 years 3 months ago
Bias correction and Bayesian analysis of aggregate counts in SAGE libraries
Background: Tag-based techniques, such as SAGE, are commonly used to sample the mRNA pool of an organism's transcriptome. Incomplete digestion during the tag formation proces...
Russell L. Zaretzki, Michael A. Gilchrist, William...