Sciweavers

5473 search results - page 61 / 1095
» On the graph isomorphism problem
Sort
View
APIN
2006
109views more  APIN 2006»
14 years 12 months ago
Visual analogy: Viewing analogical retrieval and mapping as constraint satisfaction problems
The core issue of analogical reasoning is the transfer of relational knowledge from a source case to a target problem. Visual analogical reasoning pertains to problems containing ...
Patrick W. Yaner, Ashok K. Goel
ICPR
2006
IEEE
16 years 29 days ago
Weakly Supervised Learning on Pre-image Problem in Kernel Methods
This paper presents a novel alternative approach, namely weakly supervised learning (WSL), to learn the pre-image of a feature vector in the feature space induced by a kernel. It ...
Weishi Zheng, Jian-Huang Lai, Pong Chi Yuen
VLSID
2008
IEEE
128views VLSI» more  VLSID 2008»
16 years 7 days ago
A Novel Approach to Compute Spatial Reuse in the Design of Custom Instructions
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul
CORR
2008
Springer
126views Education» more  CORR 2008»
14 years 12 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
IPL
2010
115views more  IPL 2010»
14 years 10 months ago
Hardness and approximation of minimum distortion embeddings
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
Pinar Heggernes, Daniel Meister