Sciweavers

549 search results - page 90 / 110
» On the Complexity of Restricted k-anonymity Problem
Sort
View
DOLAP
2004
ACM
15 years 3 months ago
An analysis of additivity in OLAP systems
Accurate summary data is of paramount concern in data warehouse systems; however, there have been few attempts to completely characterize the ability to summarize measures. The su...
John Horner, Il-Yeol Song, Peter P. Chen
SPATIALCOGNITION
2004
Springer
15 years 3 months ago
Branching Allen
Allen’s interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restric...
Marco Ragni, Stefan Wölfl
SAC
2010
ACM
15 years 2 months ago
An algorithm to generate the context-sensitive synchronized control flow graph
The verification of industrial systems specified with CSP often implies the analysis of many concurrent and synchronized components. The cost associated to these analyses is usu...
Marisa Llorens, Javier Oliver, Josep Silva, Salvad...
IDEAS
2002
IEEE
151views Database» more  IDEAS 2002»
15 years 2 months ago
Completing CAD Data Queries for Visualization
A system has been developed permitting database queries over data extracted from a CAD system where the query result is returned back to the CAD for visualization and analysis. Th...
Milena Gateva Koparanova, Tore Risch
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
15 years 2 months ago
Computing pure strategy nash equilibria in compact symmetric games
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...