Sciweavers

16843 search results - page 301 / 3369
» On Generalized Authorization Problems
Sort
View
IJFCS
2008
121views more  IJFCS 2008»
15 years 6 months ago
Reachability Problems in Low-Dimensional Iterative Maps
In this paper we analyse the dynamics of one-dimensional piecewise maps (PAMs). We show that one-dimensional PAMs are equivalent to pseudo-billiard or so called "strange billi...
Oleksiy Kurganskyy, Igor Potapov, Fernando Sancho-...
CVPR
2007
IEEE
16 years 8 months ago
Change Detection in a 3-d World
This paper examines the problem of detecting changes in a 3-d scene from a sequence of images, taken by cameras with arbitrary but known pose. No prior knowledge of the state of n...
Thomas Pollard, Joseph L. Mundy
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
16 years 7 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
16 years 1 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
16 years 17 days ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan