900 search results - page 104 / 180 » On Polynomial Time Computation over Unordered Structures |
ICDT
2011
ACM
13 years 6 days ago
2011
ACM
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
CAMAD
2009
IEEE
14 years 1 months ago
2009
IEEE
This paper describes SSSim, the Simple and Scalable Simulator for P2P streaming systems. SSSim is designed for performance and scalability, and allows the simulation of the diffus...
SOFSEM
2010
Springer
13 years 6 months ago
2010
Springer
It is well-known that, given a probability distribution over n characters, in the worst case it takes (n log n) bits to store a prefix code with minimum expected codeword length. H...
ICDE
2011
IEEE
13 years 14 days ago
2011
IEEE
— In many applications involving the multiple criteria optimal decision making, users may often want to make a personal trade-off among all optimal solutions. As a key feature, t...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...