1133 search results - page 141 / 227 » Basics of Graph Cuts |
MICRO
2006
IEEE
15 years 3 months ago
2006
IEEE
The superblock is a scheduling region which exposes instruction level parallelism beyond the basic block through speculative execution of instructions. In general, scheduling supe...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
IJCAI
2003
14 years 11 months ago
2003
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
LATA
2009
Springer
15 years 4 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
WAW
2007
Springer
15 years 4 months ago
2007
Springer
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...