16404 search results - page 255 / 3281 » A set coverage problem |
138
click to vote
PAMI
2006
15 years 4 months ago
2006
Three-dimensional appearance models consisting of spatially varying reflectance functions defined on a known shape can be used in analysis-by-synthesis approaches to a number of vi...
141
click to vote
TCS
2008
15 years 4 months ago
2008
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
127
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
134
click to vote
RTSS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—The functional consolidation induced by the costreduction trends in embedded systems can force tasks of different criticality (e.g. ABS Brakes with DVD) to share a proce...
106
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize ...