Sciweavers

248 search results - page 7 / 50
» On the Cayley isomorphism problem
Sort
View
IEEEVAST
2010
13 years 5 months ago
Comparing different levels of interaction constraints for deriving visual problem isomorphs
Interaction and manual manipulation have been shown in the cognitive science literature to play a critical role in problem solving. Given different types of interactions or constr...
Wenwen Dou, Caroline Ziemkiewicz, Lane Harrison, D...
CVPR
2011
IEEE
13 years 5 months ago
Local Isomorphism to Solve the Pre-image Problem in Kernel Methods
Kernel methods have been popular over the last decade to solve many computer vision, statistics and machine learning problems. An important, both theoretically and practically, op...
Dong Huang, Yuandong Tian, Fernando DelaTorre
APAL
2008
61views more  APAL 2008»
13 years 10 months ago
Second-order type isomorphisms through game semantics
The characterization of second-order type isomorphisms is a purely syntactical problem that we propose to study under the enlightenment of game semantics. We study this question i...
Joachim De Lataillade
COMBINATORICS
1998
103views more  COMBINATORICS 1998»
13 years 10 months ago
Recognizing Circulant Graphs of Prime Order in Polynomial Time
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...
Mikhail E. Muzychuk, Gottfried Tinhofer
JUCS
2008
123views more  JUCS 2008»
13 years 10 months ago
Instruction Scheduling Based on Subgraph Isomorphism for a High Performance Computer Processor
: This paper1 presents an instruction scheduling algorithm based on the Subgraph Isomorphism Problem. Given a Directed Acyclic Graph (DAG) G1, our algorithm looks for a subgraph G2...
Ricardo Santos, Rodolfo Azevedo, Guido Araujo