Sciweavers

2880 search results - page 233 / 576
» Approximate Range Searching
Sort
View
ICIP
2010
IEEE
15 years 2 months ago
A dynamic threshold approach for skin segmentation in color images
: This paper presents a novel dynamic threshold approach to discriminate skin pixels and non-skin pixels in color images. Fixed decision boundaries (or fixed threshold) classificat...
Yogarajah Pratheepan, Joan Condell, Kevin Curran, ...
ICDE
2008
IEEE
110views Database» more  ICDE 2008»
16 years 5 months ago
Standing Out in a Crowd: Selecting Attributes for Maximum Visibility
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in da...
Muhammed Miah, Gautam Das, Vagelis Hristidis, Heik...
COLT
2004
Springer
15 years 9 months ago
Boosting Based on a Smooth Margin
Abstract. We study two boosting algorithms, Coordinate Ascent Boosting and Approximate Coordinate Ascent Boosting, which are explicitly designed to produce maximum margins. To deri...
Cynthia Rudin, Robert E. Schapire, Ingrid Daubechi...
ISPAN
1997
IEEE
15 years 8 months ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal
IPL
2010
114views more  IPL 2010»
15 years 2 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer