Sciweavers

1766 search results - page 302 / 354
» Classifier Selection Based on Data Complexity Measures
Sort
View
VISUALIZATION
2002
IEEE
15 years 2 months ago
Geometric Surface Smoothing via Anisotropic Diffusion of Normals
This paper introduces a method for smoothing complex, noisy surfaces, while preserving (and enhancing) sharp, geometric features. It has two main advantages over previous approach...
Tolga Tasdizen, Ross T. Whitaker, Paul Burchard, S...
STACS
1999
Springer
15 years 2 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
TLSDKCS
2010
14 years 4 months ago
Improving Retrievability and Recall by Automatic Corpus Partitioning
Abstract. With increasing volumes of data, much effort has been devoted to finding the most suitable answer to an information need. However, in many domains, the question whether a...
Shariq Bashir, Andreas Rauber
SCIA
2005
Springer
186views Image Analysis» more  SCIA 2005»
15 years 3 months ago
Building Detection from Mobile Imagery Using Informative SIFT Descriptors
We propose reliable outdoor object detection on mobile phone imagery from off-the-shelf devices. With the goal to provide both robust object detection and reduction of computation...
Gerald Fritz, Christin Seifert, Manish Kumar, Luca...
NIPS
2008
14 years 11 months ago
Scalable Algorithms for String Kernels with Inexact Matching
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic