1554 search results - page 114 / 311 » Parameterized Complexity and Approximation Algorithms |
147
click to vote
PG
2007
IEEE
16 years 18 days ago
2007
IEEE
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
165
click to vote
ICRA
2005
IEEE
15 years 12 months ago
2005
IEEE
— This paper presents the novel insight that the SLAM information matrix is exactly sparse in a delayedstate framework. Such a framework is used in view-based representations of ...
158
click to vote
DATE
2010
IEEE
15 years 11 months ago
2010
IEEE
— This paper describes a Model Order Reduction algorithm for multi-dimensional parameterized systems, based on a sampling procedure which incorporates a low order moment matching...
189
click to vote
SIAMJO
2000
15 years 6 months ago
2000
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
193
click to vote
MOBIHOC
2002
ACM
16 years 5 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...