90 search results - page 14 / 18 » A Global Constraint for Graph Isomorphism Problems |
ICCAD
2000
IEEE
13 years 12 months ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
ECAI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. In this paper we tackle the problem of coordinating multiple decentralised agents with continuous state variables. Specifically we propose a hybrid approach, which combin...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we introduce graph-evolution rules, a novel type of frequency-based pattern that describe the evolution of large networks over time, at a local level. Given a sequenc...
ICCV
2009
IEEE
15 years 13 days ago
2009
IEEE
Geometric rearrangement of images includes operations
such as image retargeting, inpainting, or object rearrangement.
Each such operation can be characterized by a shiftmap:
the...
ICCV
1999
IEEE
14 years 8 months ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...