Sciweavers

808 search results - page 17 / 162
» Pattern Discovery and Computational Mechanics
Sort
View
SAC
2004
ACM
15 years 3 months ago
Frequent free tree discovery in graph data
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
Ulrich Rückert, Stefan Kramer
GCC
2003
Springer
15 years 2 months ago
Automated Detection of Design Patterns
: Detection of instances of design patterns is useful for the software maintenance. This paper proposes a new framework for the automated detection of instances of design patterns....
Zhixiang Zhang, Qinghua Li
WWW
2008
ACM
15 years 10 months ago
Computable social patterns from sparse sensor data
We present a computational framework to automatically discover high-order temporal social patterns from very noisy and sparse location data. We introduce the concept of social foo...
Dinh Q. Phung, Brett Adams, Svetha Venkatesh
MIDDLEWARE
2005
Springer
15 years 3 months ago
Improving flexibility on host discovery for pervasive computing middlewares
The vision of pervasive or ubiquitous computing, conceived by Mark Weiser, foresees a world where computing is embedded in every day objects. Such objects interact with each other...
Emerson Loureiro, Loreno Oliveira, Hyggo Oliveira ...
ICDCN
2011
Springer
14 years 1 months ago
Mining Frequent Subgraphs to Extract Communication Patterns in Data-Centres
In this paper, we propose to use graph-mining techniques to understand the communication pattern within a data-centre. We model the communication observed within a data-centre as a...
Maitreya Natu, Vaishali P. Sadaphal, Sangameshwar ...