962 search results - page 139 / 193 » Efficient Algorithms for Eulerian Extension |
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
SDM
2004
SIAM
14 years 11 months ago
2004
SIAM
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
163
click to vote
SENSYS
2010
ACM
14 years 7 months ago
2010
ACM
Continuously understanding a user's location context in colloquial terms and the paths that connect the locations unlocks many opportunities for emerging applications. While ...
138
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...