Sciweavers

9176 search results - page 414 / 1836
» algorithms 2010
Sort
View
ICALP
2010
Springer
15 years 8 months ago
On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
Allan Borodin, Brendan Lucier
CVPR
2010
IEEE
1778views Computer Vision» more  CVPR 2010»
16 years 2 months ago
Detecting Text in Natural Scenes with Stroke Width Transform
We present a novel image operator that seeks to find the value of stroke width for each image pixel, and demonstrate its use on the task of text detection in natural images. The s...
Boris Epshtein, Eyal Ofek, Yonatan Wexler
WAOA
2010
Springer
251views Algorithms» more  WAOA 2010»
15 years 4 months ago
How to Play Unique Games on Expanders
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...
Konstantin Makarychev, Yury Makarychev
IJNSEC
2010
247views more  IJNSEC 2010»
15 years 1 months ago
Hardware Implementation of Efficient Modified Karatsuba Multiplier Used in Elliptic Curves
The efficiency of the core Galois field arithmetic improves the performance of elliptic curve based public key cryptosystem implementation. This paper describes the design and imp...
Sameh M. Shohdy, Ashraf El-Sisi, Nabil A. Ismail
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
16 years 4 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld