4137 search results - page 740 / 828 » On the number of matchings of a tree |
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
SIGMOD
2001
ACM
14 years 8 months ago
2001
ACM
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
WWW
2010
ACM
14 years 2 months ago
2010
ACM
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...
HRI
2009
ACM
14 years 2 months ago
2009
ACM
The present study investigates the effect of the number of controlled robots on performance of an urban search and rescue (USAR) task using a realistic simulation. Participants co...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
—In host-based intrusion detection systems (HIDS), anomaly detection involves monitoring for significant deviations from normal system behavior. Hidden Markov Models (HMMs) have...