1591 search results - page 208 / 319 » Random lifts of graphs |
143
click to vote
IV
2002
IEEE
15 years 11 months ago
2002
IEEE
We present a preprocessor for the spring embedder graph drawing method and show its use in speeding up the automatic layout of three-dimensional visualizations of WWW sites. Sprin...
181
Voted
IPMI
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper we propose a novel approach to define task-driven regularization constraints in deformable image registration using learned deformation priors. Our method ...
196
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
149
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
148
click to vote
SODA
1996
ACM
15 years 7 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...