Sciweavers

11328 search results - page 20 / 2266
» Timed Branching Processes
Sort
View
121
Voted
DEDS
2007
104views more  DEDS 2007»
15 years 1 months ago
Trellis Processes : A Compact Representation for Runs of Concurrent Systems
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
Eric Fabre
ICDE
2005
IEEE
128views Database» more  ICDE 2005»
16 years 3 months ago
Exploiting Correlated Attributes in Acquisitional Query Processing
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel ...
117
Voted
ICCS
2003
Springer
15 years 7 months ago
Representing Time and Modality in Narratives with Conceptual Graphs
In this paper we investigate principles of the representation of time and modality in terms of conceptual graphs. Based on the works of A. N. Prior, and C. S. Peirce, we suggest a ...
Henrik Schärfe, Peter Øhrstrøm
101
Voted
VLDB
2000
ACM
177views Database» more  VLDB 2000»
15 years 5 months ago
The BT-tree: A Branched and Temporal Access Method
Temporal databases assume a single line of time evolution. In other words, they support timeevolving data. However there are applications which require the support of temporal dat...
Linan Jiang, Betty Salzberg, David B. Lomet, Manue...
GLVLSI
1997
IEEE
110views VLSI» more  GLVLSI 1997»
15 years 6 months ago
Algorithm and Hardware Support for Branch Anticipation
Multi-dimensional systems containing nested loops are widely used to model scientific applications such as image processing, geophysical signal processing and fluid dynamics. Ho...
Ted Zhihong Yu, Edwin Hsing-Mean Sha, Nelson L. Pa...