Sciweavers

207 search results - page 8 / 42
» Powers of cycles, powers of paths, and distance graphs
Sort
View
CAV
2006
Springer
86views Hardware» more  CAV 2006»
13 years 11 months ago
The Power of Hybrid Acceleration
This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in explori...
Bernard Boigelot, Frédéric Herbretea...
DM
2006
108views more  DM 2006»
13 years 7 months ago
Optimal broadcast domination in polynomial time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination...
Pinar Heggernes, Daniel Lokshtanov
IPL
2006
72views more  IPL 2006»
13 years 7 months ago
Structure and linear time recognition of 3-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
Andreas Brandstädt, Van Bang Le
DAC
1997
ACM
13 years 11 months ago
Power Management Techniques for Control-Flow Intensive Designs
This paper presents a low-overhead controller-based power managementtechnique that re-specifies control signals to reconfigure existing multiplexer networks and functional units t...
Anand Raghunathan, Sujit Dey, Niraj K. Jha, Kazuto...
ICCV
2009
IEEE
1714views Computer Vision» more  ICCV 2009»
15 years 16 days ago
Power watersheds: a new image segmentation framework extending graph cuts, random walker and optimal spanning forest
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, ran- dom walker, and shortest path optimization algorithms. Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...