5100 search results - page 275 / 1020 » The Linear Complexity of a Graph |
157
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
128
click to vote
VMCAI
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We introduce Subpolyhedra (SubPoly) a new numerical abstract domain to infer and propagate linear inequalities. SubPoly is as expressive as Polyhedra, but it drops some o...
178
click to vote
MIG
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Despite the large success of games grounded on movement-based interactions the current state of full body motion capture technologies still prevents the exploitation of p...
140
click to vote
ICARCV
2008
IEEE
15 years 11 months ago
2008
IEEE
— We consider a discrete-time dynamical system with Boolean and continuous states, with the continuous state propagating linearly in the continuous and Boolean state variables, a...
146
click to vote
SI3D
2006
ACM
15 years 10 months ago
2006
ACM
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...