Sciweavers

3267 search results - page 198 / 654
» Generalized quasirandom graphs
Sort
View
CVPR
2009
IEEE
17 years 1 months ago
A Tensor-Based Algorithm for High-Order Graph Matching
This paper addresses the problem of establishing correspondences between two sets of visual features using higher-order constraints instead of the unary or pairwise ones used in...
Francis R. Bach, In-So Kweon, Jean Ponce, Olivier ...
ICML
2002
IEEE
16 years 7 months ago
Diffusion Kernels on Graphs and Other Discrete Input Spaces
The application of kernel-based learning algorithms has, so far, largely been confined to realvalued data and a few special data types, such as strings. In this paper we propose a...
Risi Imre Kondor, John D. Lafferty
GLVLSI
2009
IEEE
159views VLSI» more  GLVLSI 2009»
16 years 1 months ago
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
Renshen Wang, Chung-Kuan Cheng
IWOMP
2009
Springer
16 years 1 months ago
Evaluating OpenMP 3.0 Run Time Systems on Unbalanced Task Graphs
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
Stephen Olivier, Jan Prins
DASFAA
2007
IEEE
139views Database» more  DASFAA 2007»
16 years 28 days ago
Self-tuning in Graph-Based Reference Disambiguation
Nowadays many data mining/analysis applications use the graph analysis techniques for decision making. Many of these techniques are based on the importance of relationships among t...
Rabia Nuray-Turan, Dmitri V. Kalashnikov, Sharad M...