Sciweavers

178 search results - page 9 / 36
» A Practical Algorithm to Find the Best Episode Patterns
Sort
View
JUCS
2002
163views more  JUCS 2002»
13 years 7 months ago
Finding Plagiarisms among a Set of Programs with JPlag
: JPlag is a web service that finds pairs of similar programs among a given set of programs. It has successfully been used in practice for detecting plagiarisms among student Java ...
Lutz Prechelt, Guido Malpohl, Michael Philippsen
CONIELECOMP
2005
IEEE
14 years 1 months ago
Approximate Searching on Compressed Text
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
Carlos Avendaño Pérez, Claudia Fereg...
EDBT
2011
ACM
199views Database» more  EDBT 2011»
12 years 11 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
EDBT
2006
ACM
179views Database» more  EDBT 2006»
14 years 7 months ago
TrajPattern: Mining Sequential Patterns from Imprecise Trajectories of Mobile Objects
Abstract. Mobile objects have become ubiquitous in our everyday lives, ranging from cellular phones to sensors, therefore, analyzing and mining mobile data becomes an interesting p...
Jiong Yang, Meng Hu
CAL
2002
13 years 7 months ago
Worst-case Traffic for Oblivious Routing Functions
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
Brian Towles, William J. Dally