Sciweavers

9370 search results - page 31 / 1874
» An Abstract Notion of Application
Sort
View
DKE
2002
113views more  DKE 2002»
13 years 9 months ago
A general strategy for decomposing topological invariants of spatial databases and an application
Topological invariants of spatial databases (i.e., finite structures that capture the topological properties of the database) are receiving increasing attention since they can act...
Serafino Cicerone, Daniele Frigioni, Paolino Di Fe...
SODA
1994
ACM
105views Algorithms» more  SODA 1994»
13 years 11 months ago
Approximate Data Structures with Applications
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
Yossi Matias, Jeffrey Scott Vitter, Neal E. Young
CONSTRAINTS
2010
116views more  CONSTRAINTS 2010»
13 years 10 months ago
Erratum to "Reformulating table constraints using functional dependencies - an application to explanation generation"
Abstract. We had claimed that arc-consistency is preserved in a constraint reformulation relying on functional dependencies (Theorem 2 of [2]). We show that the statement of this t...
Hadrien Cambazard, Barry O'Sullivan
DAC
2002
ACM
14 years 11 months ago
Model design using hierarchical web-based libraries
Design tools can be profitably associated with libraries of reusable modeling components that will make the description and also the validation of the models much easier. Furtherm...
Fabrice Bernardi, Jean François Santucci
DSN
2008
IEEE
14 years 4 months ago
A recurrence-relation-based reward model for performability evaluation of embedded systems
Embedded systems for closed-loop applications often behave as discrete-time semi-Markov processes (DTSMPs). Performability measures most meaningful to iterative embedded systems, ...
Ann T. Tai, Kam S. Tso, William H. Sanders