Sciweavers

1326 search results - page 92 / 266
» Approximate Tree Kernels
Sort
View
JAT
2010
88views more  JAT 2010»
13 years 7 months ago
Cauchy biorthogonal polynomials
The paper investigates the properties of certain biorthogonal polynomials appearing in a specific simultaneous Hermite–Pad´e approximation scheme. Associated with any totally ...
M. Bertola, M. Gekhtman, J. Szmigielski
ALGOSENSORS
2009
Springer
13 years 6 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
TCBB
2010
106views more  TCBB 2010»
13 years 3 months ago
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
In this paper we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a give...
Christophe Godin, Pascal Ferraro
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 6 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry
CVPR
2012
IEEE
11 years 11 months ago
RGB-(D) scene labeling: Features and algorithms
Scene labeling research has mostly focused on outdoor scenes, leaving the harder case of indoor scenes poorly understood. Microsoft Kinect dramatically changed the landscape, show...
Xiaofeng Ren, Liefeng Bo, Dieter Fox