Sciweavers

1491 search results - page 46 / 299
» Training Linear Discriminant Analysis in Linear Time
Sort
View
ICPR
2008
IEEE
15 years 4 months ago
Linear time recognition algorithms for topological invariants in 3D
In this paper, we design linear time algorithms to recognize and determine topological invariants such as genus and homology groups in 3D. These invariants can be used to identify...
Li Chen, Yongwu Rong
ISPD
1998
ACM
101views Hardware» more  ISPD 1998»
15 years 2 months ago
Greedy wire-sizing is linear time
—The greedy wire-sizing algorithm (GWSA) has been experimentally shown to be very efficient, but no mathematical analysis on its convergence rate has ever been reported. In this...
Chris C. N. Chu, D. F. Wong
ICFP
2002
ACM
15 years 9 months ago
Packrat parsing: : simple, powerful, lazy, linear time, functional pearl
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
PLDI
1994
ACM
15 years 1 months 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
CORR
2006
Springer
132views Education» more  CORR 2006»
14 years 9 months ago
Packrat Parsing: Simple, Powerful, Lazy, Linear Time
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford