Sciweavers

2233 search results - page 267 / 447
» On the Complexity of Theory Curbing
Sort
View
COCO
2010
Springer
152views Algorithms» more  COCO 2010»
15 years 10 months ago
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
Derrick Stolee, Chris Bourke, N. V. Vinodchandran
COMGEO
2010
ACM
15 years 9 months ago
Access control systems for spatial data infrastructures and their administration
Today sophisticated concepts, languages and frameworks exist, that allow implementing powerful fine grained access control systems for protecting Web Services and spatial data in ...
Jan Herrmann
DESRIST
2009
Springer
115views Education» more  DESRIST 2009»
15 years 9 months ago
Ontological design
In this paper, we describe the concept of ontological design. We show how ontologies can be used as cognitive maps of complex, ill-structured, plastic problems. They can be used t...
Arkalgud Ramaprasad, Sridhar S. Papagari
CAE
2007
15 years 9 months ago
A Poetics of Simulation for Audiovisual Performance
Audiovisual performance is a fertile area for creative expression, an intersection of experimental cinema and computer music that has seen a groundswell of interest in recent year...
Randy Jones
AAAI
2008
15 years 8 months ago
On the Dimensionality of Voting Games
In a yes/no voting game, a set of voters must determine whether to accept or reject a given alternative. Weighted voting games are a well-studied subclass of yes/no voting games, ...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...