Sciweavers

720 search results - page 130 / 144
» Linear k-arboricities on trees
Sort
View
ICPR
2006
IEEE
16 years 3 months ago
Learning Policies for Efficiently Identifying Objects of Many Classes
Viola and Jones (VJ) cascade classification methods have proven to be very successful in detecting objects belonging to a single class -- e.g., faces. This paper addresses the mor...
Ahmed M. Elgammal, Ramana Isukapalli, Russell Grei...
SIGSOFT
2007
ACM
16 years 2 months ago
Efficient token based clone detection with flexible tokenization
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
Hamid Abdul Basit, Stan Jarzabek
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
16 years 2 months ago
Extracting key-substring-group features for text classification
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
Dell Zhang, Wee Sun Lee
POPL
2006
ACM
16 years 2 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
STACS
1992
Springer
15 years 6 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...