Sciweavers

1326 search results - page 123 / 266
» Approximate Tree Kernels
Sort
View
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 9 months ago
Sublinear Optimization for Machine Learning
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
SIGMOD
2004
ACM
121views Database» more  SIGMOD 2004»
14 years 9 months ago
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao
ICIAR
2005
Springer
14 years 2 months ago
Compressing 2-D Shapes Using Concavity Trees
Concavity trees have been known for quite some time as structural descriptors of 2-D shape; however, they haven’t been explored further until recently. This paper shows how 2-D s...
Ossama El Badawy, Mohamed S. Kamel
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
13 years 10 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
ICML
2004
IEEE
14 years 9 months ago
Large margin hierarchical classification
We present an algorithmic framework for supervised classification learning where the set of labels is organized in a predefined hierarchical structure. This structure is encoded b...
Ofer Dekel, Joseph Keshet, Yoram Singer