Sciweavers

554 search results - page 59 / 111
» Power Domination Problem in Graphs
Sort
View
MVA
2007
137views Computer Vision» more  MVA 2007»
13 years 9 months ago
Object Based Contour Detection by Using Graph-cut on Stereo Image
In the last few years, computer vision and image processing techniques have been developed to solve many problems. One of them, graph cut method is powerful optimization technique...
Taehoon Kang, Jaeseung Yu, Jangseok Oh, Yunhwan Se...
ALT
2007
Springer
14 years 4 months ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava
CGO
2007
IEEE
14 years 2 months ago
On the Complexity of Register Coalescing
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which ...
Florent Bouchez, Alain Darte, Fabrice Rastello
TCAD
2008
195views more  TCAD 2008»
13 years 7 months ago
Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu, Meng-X...
FPGA
2010
ACM
209views FPGA» more  FPGA 2010»
14 years 4 months ago
FPGA power reduction by guarded evaluation
Guarded evaluation is a power reduction technique that involves identifying sub-circuits (within a larger circuit) whose inputs can be held constant (guarded) at specific times d...
Chirag Ravishankar, Jason Helge Anderson