Sciweavers

4378 search results - page 203 / 876
» On the Complexity of Ordered Colourings
Sort
View
DOCENG
2006
ACM
16 years 16 days ago
Fast and simple XML tree differencing by sequence alignment
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
Tancred Lindholm, Jaakko Kangasharju, Sasu Tarkoma
CP
2005
Springer
16 years 3 days ago
Using SAT in QBF
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
Horst Samulowitz, Fahiem Bacchus
AGP
1994
IEEE
15 years 10 months ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
DAGSTUHL
1997
15 years 8 months ago
Simple, Fast, and Robust Ray Casting of Irregular Grids
In this paper we describe a simple and efficient ray casting engine that is suitable for the rapid exploration of irregular grids composed of tetrahedra cells, or other cell comp...
Paul Bunyk, Arie E. Kaufman, Cláudio T. Sil...
TCOM
2008
105views more  TCOM 2008»
15 years 6 months ago
High-rate diversity across time and frequency using linear dispersion
To improve performance of orthogonal frequency division multiplexing (OFDM) for fading channels, this paper proposes increasing frequency and time diversity using linear dispersion...
Jinsong Wu, Steven D. Blostein