Sciweavers

2128 search results - page 209 / 426
» A general characterization of indulgence
Sort
View
ICALP
2011
Springer
14 years 10 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
INFOCOM
2011
IEEE
14 years 10 months ago
Converge-cast with MIMO
—This paper investigates throughput and delay based on a newly predominant traffic pattern, called converge-cast, where each of the n nodes in the network act as a destination w...
Luoyi Fu, Yi Qin, Xinbing Wang, Xue Liu
NAR
2011
195views Computer Vision» more  NAR 2011»
14 years 9 months ago
MitoGenesisDB: an expression data mining tool to explore spatio-temporal dynamics of mitochondrial biogenesis
Mitochondria constitute complex and flexible cellular entities, which play crucial roles in normal and pathological cell conditions. The database MitoGenesisDB focuses on the dyna...
Jean-Christophe Gelly, Mickael Orgeur, Claude Jacq...
POPL
2011
ACM
14 years 9 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
SIAMJO
2011
14 years 9 months ago
Rank-Sparsity Incoherence for Matrix Decomposition
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Pa...