189 search results - page 1 / 38 » Graph-Theoretic Solutions to Computational Geometry Problems |
WG
2009
Springer
13 years 11 months ago
2009
Springer
IMR
2004
Springer
13 years 10 months ago
2004
Springer
This paper presents a generic approach to mesh global optimization via node movement, based on a discrete graph-theoretic model. Mesh is considered as an electric system with lump...
NIPS
2008
13 years 6 months ago
2008
Metal binding is important for the structural and functional characterization of proteins. Previous prediction efforts have only focused on bonding state, i.e. deciding which prot...
TCS
2010
13 years 3 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
ISCC
2008
IEEE
13 years 11 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...