Sciweavers

46 search results - page 5 / 10
» Where should the bugs be fixed
Sort
View
SIAMDM
2008
79views more  SIAMDM 2008»
13 years 7 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...
TIT
2010
138views Education» more  TIT 2010»
13 years 2 months ago
Functional compression through graph coloring
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
Vishal Doshi, Devavrat Shah, Muriel Médard,...
BMCBI
2008
113views more  BMCBI 2008»
13 years 7 months ago
Investigating selection on viruses: a statistical alignment approach
Background: Two problems complicate the study of selection in viral genomes: Firstly, the presence of genes in overlapping reading frames implies that selection in one reading fra...
Saskia de Groot, Thomas Mailund, Gerton Lunter, Jo...
ATMOS
2009
13 years 8 months ago
Delay Management with Re-Routing of Passengers
Trains often arrive delayed at stations where passengers have to change to other trains. The question of delay management is whether these trains should wait for the original train...
Twan Dollevoet, Dennis Huisman, Marie Schmidt, Ani...
JCO
2008
102views more  JCO 2008»
13 years 7 months ago
Stable matching problems with exchange restrictions
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
Robert W. Irving