Sciweavers

361 search results - page 45 / 73
» Algorithms for Extracting Timeliness Graphs
Sort
View
SAC
2008
ACM
13 years 8 months ago
Mining fault-tolerant frequent patterns efficiently with powerful pruning
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
Jhih-Jie Zeng, Guanling Lee, Chung-Chi Lee
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
13 years 7 days ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...
CIKM
2011
Springer
12 years 8 months ago
Content-driven detection of campaigns in social media
We study the problem of detecting coordinated free text campaigns in large-scale social media. These campaigns – ranging from coordinated spam messages to promotional and advert...
Kyumin Lee, James Caverlee, Zhiyuan Cheng, Daniel ...
GBRPR
2007
Springer
14 years 2 months ago
Matching of Tree Structures for Registration of Medical Images
Many medical applications require a registration of different images of the same organ. In many cases, such a registration is accomplished by manually placing landmarks in the ima...
Jan Hendrik Metzen, Tim Kröger, Andrea Schenk...
ASWEC
2005
IEEE
14 years 2 months ago
A Formal Method for Program Slicing
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
Yingzhou Zhang, Baowen Xu, José Emilio Labr...