Sciweavers

2598 search results - page 477 / 520
» Experimental Design for Variable Selection in Data Bases
Sort
View
PAMI
2011
15 years 1 months ago
Cost-Sensitive Boosting
—A novel framework is proposed for the design of cost-sensitive boosting algorithms. The framework is based on the identification of two necessary conditions for optimal cost-sen...
Hamed Masnadi-Shirazi, Nuno Vasconcelos
TIST
2011
136views more  TIST 2011»
15 years 1 months ago
Probabilistic models for concurrent chatting activity recognition
Recognition of chatting activities in social interactions is useful for constructing human social networks. However, the existence of multiple people involved in multiple dialogue...
Jane Yung-jen Hsu, Chia-chun Lian, Wan-rong Jih
186
Voted
TSMC
2011
324views more  TSMC 2011»
15 years 1 months ago
Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
Shengxiang Yang, Sadaf Naseem Jat
SAC
2010
ACM
15 years 25 days ago
Convex onion peeling genetic algorithm: an efficient solution to map labeling of point-feature
Map labeling of point-feature is the problem of placing text labels to corresponding point features on a map in a way that minimizes overlaps while satisfying basic rules for the ...
Wan D. Bae, Shayma Alkobaisi, Petr Vojtechovsk&yac...
ICIP
2001
IEEE
16 years 7 months ago
Study of embedded font context and kernel space methods for improved videotext recognition
Videotext refers to text superimposed on video frames. A videotext based Multimedia Description Scheme has recently been adopted into the MPEG-7 standard. A study of published wor...
Chitra Dorai, Hrishikesh Aradhye, Jae-Chang Shim