Sciweavers

2294 search results - page 396 / 459
» Efficient Crosstalk Estimation
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
14 years 9 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
PAMI
2007
125views more  PAMI 2007»
14 years 9 months ago
Matching by Linear Programming and Successive Convexification
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
Hao Jiang, Mark S. Drew, Ze-Nian Li
PAMI
2007
222views more  PAMI 2007»
14 years 9 months ago
MonoSLAM: Real-Time Single Camera SLAM
—We present a real-time algorithm which can recover the 3D trajectory of a monocular camera, moving rapidly through a previously unknown scene. Our system, which we dub MonoSLAM,...
Andrew J. Davison, Ian D. Reid, Nicholas Molton, O...
PAMI
2007
166views more  PAMI 2007»
14 years 9 months ago
A Bayesian, Exemplar-Based Approach to Hierarchical Shape Matching
—This paper presents a novel probabilistic approach to hierarchical, exemplar-based shape matching. No feature correspondence is needed among exemplars, just a suitable pairwise ...
Dariu Gavrila
PVLDB
2008
144views more  PVLDB 2008»
14 years 9 months ago
Mining search engine query logs via suggestion sampling
Many search engines and other web applications suggest auto-completions as the user types in a query. The suggestions are generated from hidden underlying databases, such as query...
Ziv Bar-Yossef, Maxim Gurevich