Sciweavers

1629 search results - page 167 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
ICCV
2009
IEEE
16 years 3 months ago
Image Segmentation with A Bounding Box Prior
User-provided object bounding box is a simple and popular interaction paradigm considered by many existing interactive image segmentation frameworks. However, these frameworks t...
Victor Lempitsky, Pushmeet Kohli, Carsten Rother, ...
AAAI
2007
15 years 27 days ago
Conservative Dual Consistency
Consistencies are properties of Constraint Networks (CNs) that can be exploited in order to make inferences. When a significant amount of such inferences can be performed, CNs ar...
Christophe Lecoutre, Stéphane Cardon, Julie...
ICTAI
2008
IEEE
15 years 5 months ago
Discovering Program's Behavioral Patterns by Inferring Graph-Grammars from Execution Traces
Frequent patterns in program executions represent recurring sequences of events. These patterns can be used to reveal the hidden structures of a program, and ease the comprehensio...
Chunying Zhao, Keven Ates, Jun Kong, Kang Zhang
GD
1997
Springer
15 years 2 months ago
Area Requirements for Drawing Hierarchically Planar Graphs
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...
Xuemin Lin, Peter Eades
TWC
2008
227views more  TWC 2008»
14 years 10 months ago
Cross-layer optimization frameworks for multihop wireless networks using cooperative diversity
We propose cross-layer optimization frameworks for multihop wireless networks using cooperative diversity. These frameworks provide solutions to fundamental relaying problems of de...
Long Le, Ekram Hossain