Sciweavers

2272 search results - page 166 / 455
» Capture Complexity by Partition
Sort
View
ACSD
2006
IEEE
76views Hardware» more  ACSD 2006»
15 years 7 months ago
Specification and Verification of Dynamic Communication Systems
Dynamic communication systems (DCS) are complex because of their unboundedness in several dimensions. They have an unbounded and changing number of objects, a dynamically changing...
Jörg Bauer, Ina Schaefer, Tobe Toben, Bernd W...
SWAT
2000
Springer
97views Algorithms» more  SWAT 2000»
15 years 6 months ago
I/O-Space Trade-Offs
We define external memory (or I/O) models which capture space complexity and develop a general technique for deriving I/O-space trade-offs in these models from internal memory mode...
Lars Arge, Jakob Pagter
ICECCS
1995
IEEE
114views Hardware» more  ICECCS 1995»
15 years 6 months ago
The role of secondary attributes in formal object modelling
When modelling a large and complex system, clarzty of the speczfication becomes an znaportant factor. I n object-oriented specification, the states of individual objects are captu...
Jin Song Dong, Gordon A. Rose, Roger Duke
112
Voted
PODS
1991
ACM
93views Database» more  PODS 1991»
15 years 6 months ago
The Expressiveness of a Family of Finite Set Languages
In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a unified framework for queries and updates. By imposing simple s...
Neil Immerman, Sushant Patnaik, David W. Stemple
66
Voted
ICPR
2010
IEEE
15 years 5 months ago
Learning Probabilistic Models of Contours
We present a methodology for learning spline-based probabilistic models for sets of contours, proposing a new Monte Carlo variant of the EM algorithm to estimate the parameters of...
Laure Amate, Maria João Rendas