4894 search results - page 561 / 979 » The Guarding Problem - Complexity and Approximation |
124
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
132
click to vote
DBPL
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we revisit the view based security framework for XML without imposing any of the previously considered restrictions on the class of queries, the class of DTDs, and t...
128
click to vote
SCALESPACE
2009
Springer
15 years 11 months ago
2009
Springer
Multi-class labeling is one of the core problems in image analysis. We show how this combinatorial problem can be approximately solved using tools from convex optimization. We sugg...
116
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
— We consider a financial decision problem involving dynamic investment decisions on a single risky instrument over multiple and discrete time periods. Investment returns are as...
133
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Frames of videos with static background and dynamic foreground can be viewed as samples of signals that vary slowly in time with sparse corruption caused by foreground objects. We...