Sciweavers

75 search results - page 8 / 15
» Approximating Optimal Binary Decision Trees
Sort
View
ICDE
2010
IEEE
192views Database» more  ICDE 2010»
14 years 2 months ago
XML reasoning made practical
— We present a tool for the static analysis of XPath queries and XML Schemas. The tool introduces techniques used in the field of verification (such as binary decision diagrams...
Pierre Genevès, Nabil Layaïda
IPL
2002
118views more  IPL 2002»
13 years 7 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
13 years 2 months ago
Multistage K-Means Clustering for Scenario Tree Construction
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
Kristina Sutiene, Dalius Makackas, Henrikas Pranev...
ATVA
2007
Springer
136views Hardware» more  ATVA 2007»
14 years 1 months ago
Symbolic Fault Tree Analysis for Reactive Systems
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
Marco Bozzano, Alessandro Cimatti, Francesco Tappa...
ICIP
2006
IEEE
14 years 9 months ago
Automatic Video Genre Categorization using Hierarchical SVM
This paper presents an automatic video genre categorization scheme based on the hierarchical ontology on video genres. Ten computable spatio-temporal features are extracted to dis...
Xun Yuan, Wei Lai, Tao Mei, Xian-Sheng Hua, Xiuqin...