Sciweavers

2553 search results - page 29 / 511
» Modeling Trees with Hypertextures
Sort
View
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
15 years 1 months ago
Polynomial-Time Algorithm for the Leafage of Chordal Graphs
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
Michel Habib, Juraj Stacho
PVM
2010
Springer
14 years 8 months ago
Two Algorithms of Irregular Scatter/Gather Operations for Heterogeneous Platforms
Abstract. In this work we present two algorithms of irregular scatter/gather operations based on the binomial tree and Tr¨aff algorithms. We use the prediction provided by hetero...
Kiril Dichev, Vladimir Rychkov, Alexey L. Lastovet...
FUIN
2010
172views more  FUIN 2010»
14 years 7 months ago
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
Michal Knapik, Wojciech Penczek, Maciej Szreter, A...
ICASSP
2011
IEEE
14 years 1 months ago
Optimal structure of memory models for lossless compression of binary image contours
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
Ioan Tabus, Septimia Sarbu
ICRA
2010
IEEE
133views Robotics» more  ICRA 2010»
14 years 8 months ago
Generalized model learning for Reinforcement Learning on a humanoid robot
— Reinforcement learning (RL) algorithms have long been promising methods for enabling an autonomous robot to improve its behavior on sequential decision-making tasks. The obviou...
Todd Hester, Michael Quinlan, Peter Stone