Sciweavers

20441 search results - page 3915 / 4089
» Locally Computable Structures
Sort
View
FOCS
2009
IEEE
15 years 8 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
ICPP
2009
IEEE
15 years 8 months ago
Code Semantic-Aware Runahead Threads
Memory-intensive threads can hoard shared resources without making progress on a multithreading processor (SMT), thereby hindering the overall system performance. A recent promisi...
Tanausú Ramírez, Alex Pajuelo, Olive...
ATAL
2009
Springer
15 years 8 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
CIVR
2009
Springer
192views Image Analysis» more  CIVR 2009»
15 years 8 months ago
Example based video filters
Many of the successful multimedia retrieval systems focus on developing efficient and effective video retrieval solutions with the help of appropriate index structures. In these ...
Mihir Jain, Sreekanth Vempati, Chandrika Pulla, C....
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
15 years 8 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
« Prev « First page 3915 / 4089 Last » Next »