Sciweavers

3145 search results - page 91 / 629
» Algebraic Linear Orderings
Sort
View
ICDE
2000
IEEE
116views Database» more  ICDE 2000»
16 years 5 months ago
Query Plans for Conventional and Temporal Queries Involving Duplicates and Ordering
Most real-world database applications contain a substantial portion of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database appl...
Giedrius Slivinskas, Christian S. Jensen, Richard ...
MFCS
2005
Springer
15 years 9 months ago
Regular Sets of Higher-Order Pushdown Stacks
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
Arnaud Carayol
TPHOL
1998
IEEE
15 years 8 months ago
Program Abstraction in a Higher-Order Logic Framework
Abstraction in a Higher-Order Logic Framework Marco Benini Sara Kalvala Dirk Nowotka Department of Computer Science University of Warwick, Coventry, CV4 7AL, United Kingdom We pres...
Marco Benini, Sara Kalvala, Dirk Nowotka
CORR
2011
Springer
180views Education» more  CORR 2011»
14 years 11 months ago
Commutative Algebra of Statistical Ranking
A model for statistical ranking is a family of probability distributions whose states are orderings of a xed nite set of items. We represent the orderings as maximal chains in a ...
Bernd Sturmfels, Volkmar Welker
DEBS
2007
ACM
15 years 8 months ago
Temporal order optimizations of incremental joins for composite event detection
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...
François Bry, Michael Eckert