Sciweavers

1208 search results - page 78 / 242
» On Counting Generalized Colorings
Sort
View
TIT
2010
138views Education» more  TIT 2010»
13 years 3 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,...
ENDM
2007
88views more  ENDM 2007»
13 years 9 months ago
Graph coloring with no large monochromatic components
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
Nathan Linial, Jirí Matousek, Or Sheffet, G...
ICALP
2009
Springer
14 years 9 months ago
Towards Optimal Range Medians
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
Beat Gfeller, Peter Sanders
ICSE
2007
IEEE-ACM
14 years 9 months ago
Modeling the Effect of Size on Defect Proneness for Open-Source Software
Quality is becoming increasingly important with the continuous adoption of open-source software. Previous research has found that there is generally a positive relationship betwee...
Akif Günes Koru, Dongsong Zhang, Hongfang Liu
ICPP
2008
IEEE
14 years 3 months ago
Overcoming Scalability Challenges for Tool Daemon Launching
: Many tools that target parallel and distributed environments must co-locate a set of daemons with the distributed processes of the target application. However, efficient and por...
Dong H. Ahn, Dorian C. Arnold, Bronis R. de Supins...