Sciweavers

620 search results - page 114 / 124
» The edge-flipping group of a graph
Sort
View
CGO
2006
IEEE
14 years 1 months ago
Selecting Software Phase Markers with Code Structure Analysis
Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program...
Jeremy Lau, Erez Perelman, Brad Calder
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
14 years 28 days ago
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
14 years 27 days ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...
AAAI
2007
13 years 10 months ago
Temporal and Information Flow Based Event Detection from Social Text Streams
Recently, social text streams (e.g., blogs, web forums, and emails) have become ubiquitous with the evolution of the web. In some sense, social text streams are sensors of the rea...
Qiankun Zhao, Prasenjit Mitra, Bi Chen
ATAL
2008
Springer
13 years 9 months ago
Decentralised coordination of low-power embedded devices using the max-sum algorithm
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
Alessandro Farinelli, Alex Rogers, Adrian Petcu, N...