2168 search results - page 42 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
UCS
2004
Springer
14 years 1 months ago
2004
Springer
Fiducial tags can be recognised successfully and decoded by computer vision systems in order to produce location information. We term a system dependable if its observable results ...
COLING
2010
13 years 2 months ago
2010
We compare the performance of three statistical parsing architectures on the problem of deriving typed dependency structures for French. The architectures are based on PCFGs with ...
PPSN
2010
Springer
13 years 6 months ago
2010
Springer
The hypervolume indicator is widely used to guide the search and to evaluate the performance of evolutionary multi-objective optimization algorithms. It measures the volume of the ...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
MST
2010
13 years 2 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...