688 search results - page 31 / 138 » Comparison of Conceptual Graphs |
80
Voted
EMMCVPR
2001
Springer
15 years 2 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
75
Voted
MOBIHOC
2001
ACM
15 years 9 months ago
2001
ACM
Spatial reuse TDMA is a fixed assignment access scheme for multi-hop radio networks. The idea is to increase network capacity by letting several radio terminals use the same time ...
ICPPW
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper compares two methods for running an application composed of a set of modules on a grid. The set of modules (collectively called Montage) generates large astronomical im...
CP
2003
Springer
15 years 2 months ago
2003
Springer
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
USENIX
2007
14 years 12 months ago
2007
Random peer selection is used by numerous P2P applications; examples include application-level multicast, unstructured file sharing, and network location mapping. In most of thes...