Sciweavers

2912 search results - page 264 / 583
» Logistic Model Trees
Sort
View
WSCG
2000
107views more  WSCG 2000»
15 years 8 months ago
Faster ASV Decomposition for Orthogonal Polyhedra, Using the Extreme Vertices Model (EVM)
The alternating sum of volumes (ASV) decomposition is a widely used technique for converting a b-rep into a CSG model, with all its implicit uses and advantages -like form feature...
Antonio Aguilera, Dolors Ayala
JCNS
2006
59views more  JCNS 2006»
15 years 6 months ago
Spatio-temporal filtering properties of a dendritic cable with active spines: A modeling study in the spike-diffuse-spike framew
The spike-diffuse-spike (SDS) model describes a passive dendritic tree with active dendritic spines. Spine-head dynamics is modeled with a simple integrate-and-fire process, whils...
Yulia Timofeeva, Gabriel J. Lord, Stephen Coombes
MODELS
2010
Springer
15 years 5 months ago
Modeling Features at Runtime
A feature represents a functional requirement fulfilled by a system. Since many maintenance tasks are expressed in terms of features, it is important to establish the corresponden...
Marcus Denker, Jorge Ressia, Orla Greevy, Oscar Ni...
CAV
2012
Springer
231views Hardware» more  CAV 2012»
13 years 9 months ago
Incremental, Inductive CTL Model Checking
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
Zyad Hassan, Aaron R. Bradley, Fabio Somenzi
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
15 years 11 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...