4926 search results - page 101 / 986 » Two Graph Algorithms On an Associative Computing Model |
113
click to vote
HICSS
2006
IEEE
15 years 8 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
112
click to vote
FSTTCS
2010
Springer
15 years 14 days ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
115
click to vote
ECCV
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. This article presents a novel method for acquiring high-quality solid models of complex 3D shapes from multiple calibrated photographs. After the purely geometric constra...
156
click to vote
PVLDB
2008
15 years 28 days ago
2008
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combi...
130
click to vote
CGI
2004
IEEE
15 years 6 months ago
2004
IEEE
In this paper, we propose a new method that can consistently orient all normals of any mesh (if at all possible), while ensuring that most polygons are seen with their front-faces...