Sciweavers

438 search results - page 60 / 88
» On Perfect Switching Classes
Sort
View
ICPR
2002
IEEE
14 years 1 months ago
Graphics Recognition from Binary Images: One Step or Two Steps
Recognizing graphic objects from binary images is an important task in many real-life applications. Generally, there are two ways to do the graphics recognition: onestep methods a...
Jiqiang Song, Min Cai, Michael R. Lyu, Shijie Cai
PLDI
1994
ACM
14 years 25 days ago
The Program Structure Tree: Computing Control Regions in Linear Time
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
Richard Johnson, David Pearson, Keshav Pingali
ECML
2004
Springer
14 years 14 days ago
Naive Bayesian Classifiers for Ranking
It is well-known that naive Bayes performs surprisingly well in classification, but its probability estimation is poor. In many applications, however, a ranking based on class prob...
Harry Zhang, Jiang Su
SOFSEM
2000
Springer
14 years 9 days ago
Towards High Speed Grammar Induction on Large Text Corpora
Abstract. In this paper we describe an e cient and scalable implementation for grammar induction based on the EMILE approach ( 2], 3], 4], 5], 6]). The current EMILE 4.1 implementa...
Pieter W. Adriaans, Marten Trautwein, Marco Vervoo...
ACID
2006
236views Algorithms» more  ACID 2006»
13 years 10 months ago
Kernelization for Convex Recoloring
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
Hans L. Bodlaender, Michael R. Fellows, Michael A....