Sciweavers

631 search results - page 47 / 127
» Additive Approximation for Edge-Deletion Problems
Sort
View
WINE
2009
Springer
194views Economy» more  WINE 2009»
15 years 4 months ago
Mechanism Design for Complexity-Constrained Bidders
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
Ravi Kumar, Mohammad Mahdian, Amin Sayedi
ICRA
2006
IEEE
120views Robotics» more  ICRA 2006»
15 years 3 months ago
Autonomous Enhancement of Disruption Tolerant Networks
— Mobile robots have successfully solved many real world problems. In the following we present the use of mobile robots to address the novel and challenging problem of providing ...
Brendan Burns, Oliver Brock, Brian Neil Levine
SIBGRAPI
2005
IEEE
15 years 3 months ago
A Linear Algorithm for Exact Pattern Matching in Planar Subdivisions
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
Pedro Ribeiro de Andrade Neto, André Luiz P...
FOCS
2007
IEEE
15 years 4 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
ECCV
2004
Springer
15 years 11 months ago
User Assisted Separation of Reflections from a Single Image Using a Sparsity Prior
When we take a picture through transparent glass the image we obtain is often a linear superposition of two images: the image of the scene beyond the glass plus the image of the sc...
Anat Levin, Yair Weiss