Sciweavers

1237 search results - page 141 / 248
» Abstract shade trees
Sort
View
ML
2011
ACM
308views Machine Learning» more  ML 2011»
13 years 4 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
MICS
2010
81views more  MICS 2010»
13 years 8 months ago
Tactics for Hierarchical Proof
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
David Aspinall, Ewen Denney, Christoph Lüth
ESOP
2008
Springer
13 years 12 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
ECCV
2006
Springer
14 years 12 months ago
A Learning Based Approach for 3D Segmentation and Colon Detagging
Abstract. Foreground and background segmentation is a typical problem in computer vision and medical imaging. In this paper, we propose a new learning based approach for 3D segment...
Zhuowen Tu, Xiang Zhou, Dorin Comaniciu, Luca Bogo...
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
14 years 10 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle