Sciweavers

2520 search results - page 405 / 504
» The complexity of approximating entropy
Sort
View
SMA
2003
ACM
154views Solid Modeling» more  SMA 2003»
15 years 9 months ago
Discretization of functionally based heterogeneous objects
The presented approach to discretization of functionally defined heterogeneous objects is oriented towards applications associated with numerical simulation procedures, for exampl...
Elena Kartasheva, Valery Adzhiev, Alexander A. Pas...
ECAL
2003
Springer
15 years 9 months ago
Critical Values in Asynchronous Random Boolean Networks
Abstract Wherever we see life, we see different kinds of complex networks, reason why they are studied across various fields of science. Random Boolean Networks (RBNs) form a spe...
Bertrand Mesot, Christof Teuscher
ECML
2003
Springer
15 years 9 months ago
Robust k-DNF Learning via Inductive Belief Merging
A central issue in logical concept induction is the prospect of inconsistency. This problem may arise due to noise in the training data, or because the target concept does not fit...
Frédéric Koriche, Joël Quinquet...
ECCV
2010
Springer
15 years 9 months ago
Stacked Hierarchical Labeling
In this work we propose a hierarchical approach for labeling semantic objects and regions in scenes. Our approach is reminiscent of early vision literature in that we use a decompo...
ECCV
2010
Springer
15 years 9 months ago
TriangleFlow: Optical Flow with Triangulation-based Higher-Order Likelihoods
Abstract. We use a simple yet powerful higher-order conditional random field (CRF) to model optical flow. It consists of a standard photoconsistency cost and a prior on affine mo...