1105 search results - page 99 / 221 » Linear choosability of graphs |
145
click to vote
JCDCG
2000
Springer
15 years 8 months ago
2000
Springer
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...
128
click to vote
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) usin...
165
click to vote
TIT
2010
14 years 11 months ago
2010
Abstract--Motivated by applications of distributed linear estimation, distributed control, and distributed optimization, we consider the question of designing linear iterative algo...
114
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...
177
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...