Sciweavers

1778 search results - page 225 / 356
» On the Power of the Randomized Iterate
Sort
View
CVPR
2005
IEEE
16 years 8 months ago
Matching with PROSAC - Progressive Sample Consensus
A new robust matching method is proposed. The Progressive Sample Consensus (PROSAC) algorithm exploits the linear ordering defined on the set of correspondences by a similarity fu...
Ondrej Chum, Jiri Matas
ECCV
2008
Springer
16 years 8 months ago
Keypoint Signatures for Fast Learning and Recognition
Abstract. Statistical learning techniques have been used to dramatically speed-up keypoint matching by training a classifier to recognize a specific set of keypoints. However, the ...
Michael Calonder, Vincent Lepetit, Pascal Fua
SPAA
2009
ACM
16 years 7 months ago
A DoS-resilient information system for dynamic data management
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...
Matthias Baumgart, Christian Scheideler, Stefan Sc...
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
16 years 3 months ago
Amplified Hardness of Approximation for VCG-Based Mechanisms
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
Shaddin Dughmi, Hu Fu, Robert Kleinberg
ALT
2007
Springer
16 years 3 months ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava