1142 search results - page 127 / 229 » Approximability of Clausal Constraints |
187
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
195
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
202
click to vote
TASLP
2008
15 years 6 months ago
2008
Convolution tree kernel has shown promising results in semantic role labeling (SRL). However, this kernel does not consider much linguistic knowledge in kernel design and only perf...
184
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract— Robotic routers (mobile robots with wireless communication capabilities) can create an adaptive wireless network and provide communication services for mobile users ond...
184
click to vote
ICIP
2010
IEEE
2010
IEEE
Restoration of images and 3D data to higher resolution by deconvolution with sparsity regularization
15 years 4 months ago
Image convolution is conventionally approximated by the LTI discrete model. It is well recognized that the higher the sampling rate, the better is the approximation. However somet...