114 search results - page 5 / 23 » The Tree Inclusion Problem: In Linear Space and Faster |
SODA
2000
ACM
14 years 10 months ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
FGCS
2000
14 years 9 months ago
2000
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
JACM
2007
14 years 9 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
103
click to vote
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
We propose a classification method based on a decision tree whose nodes consist of linear Support Vector Machines (SVMs). Each node defines a decision hyperplane that classifies p...