Sciweavers

4926 search results - page 122 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
GMP
2008
IEEE
197views Solid Modeling» more  GMP 2008»
15 years 9 months ago
Determining Directional Contact Range of Two Convex Polyhedra
The directional contact range of two convex polyhedra is the range of positions that one of the polyhedron may locate along a given straight line so that the two polyhedra are in c...
Yi-King Choi, Xueqing Li, Fengguang Rong, Wenping ...
124
Voted
MSWIM
2006
ACM
15 years 8 months ago
Two methods of authenticated positioning
Recent studies and publications have shown a demand for a secure method to proof someones or somenthings position via a communication channel. In this paper we present a concept a...
Thomas Mundt
AINA
2008
IEEE
15 years 9 months ago
Structure of the Thai Web Graph
This paper presents structural properties of the Thai Web graph. We conduct an empirical study on the Web graphs induced from two Thai web snapshots crawled during January 2007 (5...
Kulwadee Somboonviwat, Shinji Suzuki, Masaru Kitsu...
132
Voted
GBRPR
2005
Springer
15 years 8 months ago
Reactive Tabu Search for Measuring Graph Similarity
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...
Sébastien Sorlin, Christine Solnon
ECCV
2006
Springer
16 years 4 months ago
Comparison of Energy Minimization Algorithms for Highly Connected Graphs
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
Vladimir Kolmogorov, Carsten Rother