Sciweavers

2035 search results - page 303 / 407
» On the complexity of stratified logics
Sort
View
DOLAP
2006
ACM
15 years 4 months ago
Building a web warehouse for accessibility data
As more and more information is available on the web, it is a problem that many web resources are not accessible, i.e., are not usable for users with special needs. For example, f...
Christian Thomsen, Torben Bach Pedersen
101
Voted
NIPS
2007
15 years 2 months ago
Learning and using relational theories
Much of human knowledge is organized into sophisticated systems that are often called intuitive theories. We propose that intuitive theories are mentally represented in a logical ...
Charles Kemp, Noah Goodman, Joshua B. Tenenbaum
114
Voted
EDBTW
2010
Springer
14 years 11 months ago
Using web-based personalization on spatial data warehouses
Spatial data warehouses (SDW) rely on extended multidimensional (MD) models in order to provide decision makers with appropriate structures to intuitively analyse spatial data. Se...
Octavio Glorio, Jose-Norberto Mazón, Irene ...
87
Voted
SPAA
2009
ACM
16 years 1 months ago
Routing without ordering
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
Bernadette Charron-Bost, Antoine Gaillard, Jennife...
111
Voted
STACS
2010
Springer
15 years 7 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey