Sciweavers

4850 search results - page 245 / 970
» Approximate Data Structures with Applications
Sort
View
ICANN
2009
Springer
16 years 1 months ago
Adaptive Feature Transformation for Image Data from Non-stationary Processes
Abstract. This paper introduces the application of the feature transformation approach proposed by Torkkola [1] to the domain of image processing. Thereto, we extended the approach...
Erik Schaffernicht, Volker Stephan, Horst-Michael ...
3DIM
2007
IEEE
16 years 29 days ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
TKDE
2010
184views more  TKDE 2010»
15 years 5 months ago
The Dynamic Bloom Filters
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan L...
NN
2000
Springer
177views Neural Networks» more  NN 2000»
15 years 6 months ago
Independent component analysis: algorithms and applications
A fundamental problem in neural network research, as well as in many other disciplines, is finding a suitable representation of multivariate data, i.e. random vectors. For reasons...
Aapo Hyvärinen, Erkki Oja
CIKM
2011
Springer
14 years 6 months ago
Semi-supervised multi-task learning of structured prediction models for web information extraction
Extracting information from web pages is an important problem; it has several applications such as providing improved search results and construction of databases to serve user qu...
Paramveer S. Dhillon, Sundararajan Sellamanickam, ...