Sciweavers

2124 search results - page 146 / 425
» Repairing Structurally Complex Data
Sort
View
ENTCS
2008
121views more  ENTCS 2008»
13 years 11 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie
DATESO
2009
101views Database» more  DATESO 2009»
13 years 8 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
CIMCA
2006
IEEE
14 years 2 months ago
An Improvement in Sugeno-Yasukawa Modeler
Structure identification is one of the most significant steps in Fuzzy modeling of a complex system. Efficient structure identification requires good approximation of the effectiv...
Amir Hossein Hadad, Saeed Shiry Ghidary, Saeed Bag...
ICML
2010
IEEE
13 years 12 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
PR
2011
13 years 1 months ago
Detecting and discriminating behavioural anomalies
This paper aims to address the problem of anomaly detection and discrimination in complex behaviours, where anomalies are subtle and difficult to detect owing to the complex tempo...
Chen Change Loy, Tao Xiang, Shaogang Gong