95 search results - page 7 / 19 » Finding one tight cycle |
ADHOC
2008
13 years 10 months ago
2008
The diversity of applications and typically scarce node resources set very tight constraints to Wireless Sensor Networks (WSN). It is not possible to fulfill all requirements with...
CCCG
2009
13 years 11 months ago
2009
Given a set of blue points and a set of red points in ddimensional space, we show how to find an axis-aligned hyperrectangle that contains no red points and as many blue points as...
CASES
2006
ACM
14 years 1 months ago
2006
ACM
This paper proposes an efficient method to analyze worst case interruption delay (WCID) of a workload running on modern microprocessors using a cycle accurate simulator (CAS). Our...
DAM
2010
13 years 10 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
JMLR
2006
13 years 9 months ago
2006
An essential step in designing a new computer architecture is the careful examination of different design options. It is critical that computer architects have efficient means by ...