Sciweavers

279 search results - page 53 / 56
» Type-II Optimal Polynomial Bases
Sort
View
ATAL
2005
Springer
14 years 2 months ago
Exploiting belief bounds: practical POMDPs for personal assistant agents
Agents or agent teams deployed to assist humans often face the challenges of monitoring the state of key processes in their environment (including the state of their human users t...
Pradeep Varakantham, Rajiv T. Maheswaran, Milind T...
ICALP
2010
Springer
14 years 1 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
ECCV
2006
Springer
14 years 10 months ago
Self-calibration of a General Radially Symmetric Distortion Model
Abstract. We present a new approach for self-calibrating the distortion function and the distortion center of cameras with general radially symmetric distortion. In contrast to mos...
Jean-Philippe Tardif, Peter F. Sturm, Sébas...
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 9 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
PODC
2009
ACM
14 years 9 months ago
Concurrent imitation dynamics in congestion games
Imitating successful behavior is a natural and frequently applied approach to trust in when facing scenarios for which we have little or no experience upon which we can base our d...
Heiner Ackermann, Petra Berenbrink, Simon Fischer,...