Sciweavers

263 search results - page 38 / 53
» Path partitions of hypercubes
Sort
View
DM
2000
150views more  DM 2000»
13 years 7 months ago
A note on generalized chromatic number and generalized girth
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
Béla Bollobás, Douglas B. West
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 8 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
SASP
2009
IEEE
222views Hardware» more  SASP 2009»
14 years 2 months ago
Arithmetic optimization for custom instruction set synthesis
Abstract—One of the ways that custom instruction set extensions can improve over software execution is through the use of hardware structures that have been optimized at the arit...
Ajay K. Verma, Yi Zhu, Philip Brisk, Paolo Ienne
INFOCOM
2009
IEEE
14 years 2 months ago
Capacity Provisioning a Valiant Load-Balanced Network
—Valiant load balancing (VLB), also called two-stage load balancing, is gaining popularity as a routing scheme that can serve arbitrary traffic matrices. To date, VLB network de...
Andrew R. Curtis, Alejandro López-Ortiz
INFOCOM
2009
IEEE
14 years 2 months ago
CASE: Connectivity-Based Skeleton Extraction in Wireless Sensor Networks
Abstract—Many sensor network applications are tightly coupled with the geometric environment where the sensor nodes are deployed. The topological skeleton extraction has shown gr...
Hongbo Jiang, Wenping Liu, Dan Wang, Chen Tian, Xi...