697 search results - page 31 / 140 » Approximation of Information Granule Sets |
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
JAIR
2006
14 years 11 months ago
2006
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
105
click to vote
ESA
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
133
click to vote
SIGGRAPH
2010
ACM
15 years 4 months ago
2010
ACM
Repeated elements are ubiquitous and abundant in both manmade and natural scenes. Editing such images while preserving the repetitions and their relations is nontrivial due to over...
TIP
2008
14 years 11 months ago
2008
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...