Sciweavers

455 search results - page 36 / 91
» On Trees and Noncrossing Partitions
Sort
View
JIRS
2008
100views more  JIRS 2008»
13 years 7 months ago
Model-based Predictive Control of Hybrid Systems: A Probabilistic Neural-network Approach to Real-time Control
Abstract This paper proposes an approach for reducing the computational complexity of a model-predictive-control strategy for discrete-time hybrid systems with discrete inputs only...
Bostjan Potocnik, Gasper Music, Igor Skrjanc, Boru...
BMCBI
2006
114views more  BMCBI 2006»
13 years 7 months ago
Taxonomic colouring of phylogenetic trees of protein sequences
Background: Phylogenetic analyses of protein families are used to define the evolutionary relationships between homologous proteins. The interpretation of protein-sequence phyloge...
Gareth Palidwor, Emmanuel G. Reynaud, Miguel A. An...
WG
2007
Springer
14 years 1 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
IMR
2003
Springer
14 years 1 months ago
BSP-Assisted Constrained Tetrahedralization
In this paper we tackle the problem of tetrahedralization by breaking non-convex polyhedra into convex subpolyhedra, tetrahedralizing these convex subpolyhedra and merging them to...
Bhautik Joshi, Sébastien Ourselin
SI3D
1995
ACM
13 years 11 months ago
Shadow Volume BSP Trees for Computation of Shadows in Dynamic Scenes
This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modi cation of Shadow Volume Binary Space...
Yiorgos Chrysanthou, Mel Slater