2412 search results - page 211 / 483 » Which Problems Have Strongly Exponential Complexity |
119
click to vote
IWMM
2007
Springer
15 years 10 months ago
2007
Springer
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
177
click to vote
ICPP
2000
IEEE
15 years 8 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
132
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
159
click to vote
VLDB
2005
ACM
15 years 9 months ago
2005
ACM
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
131
click to vote
FC
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Participants in e-commerce and other forms of online collaborations tend to be selfish and rational, and therefore game theory has been recognized as particularly relevan...