198 search results - page 36 / 40 » Practical Algorithms for Tracking Database Join Sizes |
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
IPSN
2007
Springer
14 years 2 months ago
2007
Springer
Surveillance is one of the promising applications to which smart camera motes forming a vision-enabled network can add increasing levels of intelligence. We see a high degree of i...
OOPSLA
2007
Springer
14 years 2 months ago
2007
Springer
Omniscient debuggers make it possible to navigate backwards in time within a program execution trace, drastically improving the task of debugging complex applications. Still, they...
SIGMOD
2010
ACM
13 years 8 months ago
2010
ACM
Most previous research on privacy-preserving data publishing, based on the k-anonymity model, has followed the simplistic approach of homogeneously giving the same generalized val...
KDD
2006
ACM
14 years 9 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...