Sciweavers

148 search results - page 22 / 30
» Constructing Big Trees from Short Sequences
Sort
View
PAKDD
2007
ACM
110views Data Mining» more  PAKDD 2007»
15 years 11 months ago
Combining Convolution Kernels Defined on Heterogeneous Sub-structures
Convolution kernels, constructed by convolution of sub-kernels defined on sub-structures of composite objects, are widely used in classification, where one important issue is to ch...
Minlie Huang, Xiaoyan Zhu
NIPS
2007
15 years 7 months ago
Discriminative Keyword Selection Using Support Vector Machines
Many tasks in speech processing involve classification of long term characteristics of a speech segment such as language, speaker, dialect, or topic. A natural technique for dete...
William M. Campbell, Fred S. Richardson
EOR
2007
198views more  EOR 2007»
15 years 5 months ago
Airline crew scheduling from planning to operations
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
Claude P. Medard, Nidhi Sawhney
178
Voted
TCSV
2008
150views more  TCSV 2008»
15 years 5 months ago
Mining Recurring Events Through Forest Growing
Recurring events are short temporal patterns that consist of multiple instances in the target database. Without any a priori knowledge of the recurring events, in terms of their le...
Junsong Yuan, Jingjing Meng, Ying Wu, Jiebo Luo
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
16 years 6 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...