388 search results - page 77 / 78 » On the Number of Cycles in Planar Graphs |
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
CGO
2006
IEEE
14 years 1 months ago
2006
IEEE
Explicit Data Graph Execution (EDGE) architectures offer the possibility of high instruction-level parallelism with energy efficiency. In EDGE architectures, the compiler breaks ...
VLDB
2008
ACM
14 years 8 months ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
RT
2004
Springer
14 years 1 months ago
2004
Springer
Pixels store a digital image as a grid of point samples that can reconstruct a limited-bandwidth continuous 2-D source image. Although convenient for anti-aliased display, these b...
4OR
2010
13 years 7 months ago
2010
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...