6368 search results - page 316 / 1274 » Modeling Problem Transformations based on Data Complexity |
188
click to vote
SWAT
1994
Springer
15 years 11 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
210
click to vote
CP
2005
Springer
16 years 1 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
203
click to vote
SDM
2008
SIAM
15 years 9 months ago
2008
SIAM
Currently, many privacy-preserving data mining (PPDM) algorithms assume the semi-honest model and/or malicious model of multi-party interaction. However, both models are far from ...
225
Voted
FASE
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicab...
198
click to vote
KI
2007
Springer
15 years 7 months ago
2007
Springer
Various forms of reasoning, the profusion of knowledge, the gap between neuro-inspired approaches and conceptual representations, the problem of inconsistent data input, and the ma...