Sciweavers

1389 search results - page 118 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
ECCV
2008
Springer
16 years 5 months ago
Improving Shape Retrieval by Learning Graph Transduction
Abstract. Shape retrieval/matching is a very important topic in computer vision. The recent progress in this domain has been mostly driven by designing smart features for providing...
Xingwei Yang, Xiang Bai, Longin Jan Latecki, Zhuow...
101
Voted
CRYPTO
2004
Springer
86views Cryptology» more  CRYPTO 2004»
15 years 8 months ago
On Multiple Linear Approximations
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
Alex Biryukov, Christophe De Cannière, Mich...
145
Voted
DCOSS
2010
Springer
15 years 6 months ago
Approximate Distributed Kalman Filtering for Cooperative Multi-agent Localization
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
Prabir Barooah, Wm. Joshua Russell, João P....
MLG
2007
Springer
15 years 9 months ago
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
Alex J. Smola
PODC
2006
ACM
15 years 9 months ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille