241 search results - page 16 / 49 » Graphs, Hypergraphs and Hashing |
113
click to vote
IADIS
2003
15 years 3 months ago
2003
This article proposes an approach to the generation of guided tours over indexed information resources on user demand. It represents an alternative to more sophisticated hyperdocu...
82
Voted
SIAMDM
2010
15 years 8 days ago
2010
Let F be an r-uniform hypergraph with f vertices, where f > r ≥ 3. In [12], R. Yuster posed the problem of whether there exists an algorithm which, for a given r-uniform hyper...
101
click to vote
EJC
2008
15 years 1 months ago
2008
Abstract. We prove a general theorem on semigroup functions that implies characterizations of graph partition functions in terms of the positive semidefiniteness (`reflection posit...
135
click to vote
ICCS
2009
Springer
15 years 8 months ago
2009
Springer
Irregular and sparse scientific computing programs frequently experience performance losses due to inefficient use of the memory system in most machines. Previous work has shown t...
179
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
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...