Sciweavers

2292 search results - page 117 / 459
» Hierarchical approximation and localization
Sort
View
ICPR
2006
IEEE
16 years 5 months ago
Metric tree partitioning and Taylor approximation for fast support vector classification
This paper presents a method to speed up support vector classification, especially important when data is highdimensional. Unlike previous approaches which focus on less support v...
Thang V. Pham, Arnold W. M. Smeulders
CPC
2008
135views more  CPC 2008»
15 years 4 months ago
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
Michael Fuchs
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
15 years 2 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
ISBI
2008
IEEE
16 years 5 months ago
On approximation of orientation distributions by means of spherical ridgelets
Visualization and analysis of the micro-architecture of brain parenchyma by means of magnetic resonance imaging is nowadays believed to be one of the most powerful tools used for ...
Oleg V. Michailovich, Yogesh Rathi
COCOA
2008
Springer
15 years 6 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner