Sciweavers

10608 search results - page 473 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
137
Voted
CAINE
2003
15 years 6 months ago
Semi Greedy Algorithm for Finding Connectivity in Microchip Physical Layouts
Scan based or Line Sweep methods are a traditional mechanism to traverse the physical layout, or artwork of a microchip. These traversals are incremental in nature. They typically...
Clemente Izurieta
122
Voted
PR
2006
119views more  PR 2006»
15 years 4 months ago
Fingerprint matching by genetic algorithms
Fingerprint matching is still a challenging problem for reliable person authentication because of the complex distortions involved in two impressions of the same finger. In this p...
Xuejun Tan, Bir Bhanu
170
Voted
TIP
2008
261views more  TIP 2008»
15 years 4 months ago
CTex - An Adaptive Unsupervised Segmentation Algorithm Based on Color-Texture Coherence
Abstract--This paper presents the development of an unsupervised image segmentation framework (referred to as CTex) that is based on the adaptive inclusion of color and texture in ...
Dana Elena Ilea, Paul F. Whelan
TNN
2008
97views more  TNN 2008»
15 years 4 months ago
Training Hard-Margin Support Vector Machines Using Greedy Stagewise Algorithm
Hard-margin support vector machines (HM-SVMs) suffer from getting overfitting in the presence of noise. Soft-margin SVMs deal with this problem by introducing a regularization term...
Liefeng Bo, Ling Wang, Licheng Jiao
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 4 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng