1949 search results - page 131 / 390 » Random graphs on surfaces |
155
click to vote
ANOR
2002
15 years 4 months ago
2002
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical result...
124
click to vote
VRML
1998
ACM
15 years 8 months ago
1998
ACM
We present a new method for (1) automatically generating multiple Levels Of Detail (LODs) of a polygonal surface, (2) progressively loading, or transmitting, and displaying a surf...
149
click to vote
ACCV
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
127
click to vote
ICC
2008
IEEE
15 years 11 months ago
2008
IEEE
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
130
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...