90 search results - page 14 / 18 » A Global Constraint for Graph Isomorphism Problems |
125
click to vote
ICCAD
2000
IEEE
15 years 7 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...
124
Voted
ECAI
2010
Springer
15 years 1 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...
115
click to vote
PKDD
2009
Springer
15 years 10 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...
140
click to vote
ICCV
2009
IEEE
16 years 8 months 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...
181
Voted
ICCV
1999
IEEE
16 years 4 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...