Sciweavers

5055 search results - page 359 / 1011
» Relative Timing
Sort
View
202
Voted
SBBD
2004
119views Database» more  SBBD 2004»
15 years 8 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
ECAI
2010
Springer
15 years 8 months ago
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
Davide Bresolin, Dario Della Monica, Valentin Gora...
ICDE
2002
IEEE
138views Database» more  ICDE 2002»
16 years 8 months ago
Efficient Temporal Join Processing Using Indices
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
Donghui Zhang, Vassilis J. Tsotras, Bernhard Seege...
ICC
2007
IEEE
101views Communications» more  ICC 2007»
16 years 1 months ago
Range-based Mobility Estimations in MANETs with Application to Link Availability Prediction
— The quality of communications in mobile ad-hoc networks is largely determined by the topological stability. Characterizing the mobility of mobile nodes (e.g. how often they mov...
Zhuoqun Li, Lingfen Sun, Emmanuel C. Ifeachor
207
Voted
ICALP
1998
Springer
15 years 11 months ago
A Neuroidal Architecture for Cognitive Computation
An architecture is described for designing systems that acquire and manipulate large amounts of unsystematized, or so-called commonsense, knowledge. Its aim is to exploit to the fu...
Leslie G. Valiant