2657 search results - page 328 / 532 » On the complexity of hierarchical problem solving |
186
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
181
click to vote
PODS
2005
ACM
16 years 7 months ago
2005
ACM
We consider here the exchange of Active XML (AXML) data, i.e., XML documents where some of the data is given explicitly while other parts are given only intensionally as calls to ...
177
click to vote
PODS
2008
ACM
16 years 7 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
170
click to vote
ICDCS
2009
IEEE
16 years 4 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
225
click to vote
ACML
2009
Springer
16 years 1 months ago
2009
Springer
Real-world face recognition systems are sometimes confronted with degraded face images, e.g., low-resolution, blurred, and noisy ones. Traditional two-step methods have limited per...