Sciweavers

2127 search results - page 247 / 426
» Computing large matchings fast
Sort
View
FOCS
1989
IEEE
15 years 8 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
IJCV
2002
227views more  IJCV 2002»
15 years 4 months ago
Calculating Dense Disparity Maps from Color Stereo Images, an Efficient Implementation
Abstract-- This paper presents an efficient implementation for correlation based stereo. Research in this area can roughly be divided in two classes: improving accuracy regardless ...
Karsten Mühlmann, Dennis Maier, Jürgen H...
128
Voted
NCA
2007
IEEE
15 years 4 months ago
Using evolution to improve neural network learning: pitfalls and solutions
: Autonomous neural network systems typically require fast learning and good generalization performance, and there is potentially a trade-off between the two. The use of evolutiona...
John A. Bullinaria
RSCTC
2010
Springer
178views Fuzzy Logic» more  RSCTC 2010»
15 years 2 months ago
Blind Music Timbre Source Isolation by Multi- resolution Comparison of Spectrum Signatures
Automatic indexing of music instruments for multi-timbre sounds is challenging, especially when partials from different sources are overlapping with each other. Temporal features, ...
Xin Zhang, Wenxin Jiang, Zbigniew W. Ras, Rory A. ...
123
Voted
ICCV
2009
IEEE
15 years 2 months ago
SCRAMSAC: Improving RANSAC's efficiency with a spatial consistency filter
Geometric verification with RANSAC has become a crucial step for many local feature based matching applications. Therefore, the details of its implementation are directly relevant...
Torsten Sattler, Bastian Leibe, Leif Kobbelt