Sciweavers

554 search results - page 33 / 111
» Power Domination Problem in Graphs
Sort
View
DAC
2006
ACM
14 years 8 months ago
Leakage power reduction of embedded memories on FPGAs through location assignment
Transistor leakage is poised to become the dominant source of power dissipation in digital systems, and reconfigurable devices are not immune to this problem. Modern FPGAs already...
Yan Meng, Timothy Sherwood, Ryan Kastner
STACS
2010
Springer
14 years 2 months ago
Large-Girth Roots of Graphs
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
Anna Adamaszek, Michal Adamaszek
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
13 years 9 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau
INFOCOM
2005
IEEE
14 years 1 months ago
Power aware routing for sensor databases
— Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [1] are the dominant architectures...
Chiranjeeb Buragohain, Divyakant Agrawal, Subhash ...
IMC
2005
ACM
14 years 1 months ago
The Power of Slicing in Internet Flow Measurement
Flow measurement evolved into the primary method for measuring the composition of Internet traffic. Large ISPs and small networks use it to track dominant applications, dominant ...
Ramana Rao Kompella, Cristian Estan