Sciweavers

96 search results - page 16 / 20
» Restructuring ordered binary trees
Sort
View
ICMLA
2009
14 years 7 months ago
Structured Prediction with Relative Margin
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...
Pannagadatta K. Shivaswamy, Tony Jebara
ICDE
2006
IEEE
147views Database» more  ICDE 2006»
15 years 3 months ago
Efficient Processing of Updates in Dynamic XML Data
It is important to process the updates when nodes are inserted into or deleted from the XML tree. All the existing labeling schemes have high update cost, thus in this paper we pr...
Changqing Li, Tok Wang Ling, Min Hu
74
Voted
CORR
2004
Springer
100views Education» more  CORR 2004»
14 years 9 months ago
On the Theory of Structural Subtyping
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
Viktor Kuncak, Martin C. Rinard
CORR
2006
Springer
153views Education» more  CORR 2006»
14 years 9 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
CORR
2007
Springer
140views Education» more  CORR 2007»
14 years 9 months ago
From the entropy to the statistical structure of spike trains
— We use statistical estimates of the entropy rate of spike train data in order to make inferences about the underlying structure of the spike train itself. We first examine a n...
Yun Gao, Ioannis Kontoyiannis, Elie Bienenstock