1346 search results - page 233 / 270 » On the number of rectangular partitions |
72
Voted
STACS
2007
Springer
15 years 3 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
109
click to vote
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
—We present MobiStream— a video streaming system that exploits the perceptual value in video content and the characteristics of the link layer and physical layer channels to en...
SIGIR
2005
ACM
15 years 3 months ago
2005
ACM
The TREC .GOV collection makes a valuable web testbed for distributed information retrieval methods because it is naturally partitioned and includes 725 web-oriented queries with ...
86
Voted
IPSN
2005
Springer
15 years 3 months ago
2005
Springer
Abstract— Sensing, processing and communication must be jointly optimized for efficient operation of resource-limited wireless sensor networks. We propose a novel source-channel...
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...