Sciweavers

2027 search results - page 12 / 406
» Learning and Generalization with the Information Bottleneck
Sort
View
CIKM
2009
Springer
15 years 4 months ago
A general magnitude-preserving boosting algorithm for search ranking
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
Chenguang Zhu, Weizhu Chen, Zeyuan Allen Zhu, Gang...
WIMOB
2008
IEEE
15 years 4 months ago
An Ad Hoc Network Infrastructure: Communication and Information Sharing for Emergency Response
— During an emergency response, access to a reliable communication infrastructure is required to exchange accurate information in a timely manner. Various communication technolog...
Raheleh B. Dilmaghani, Ramesh R. Rao
ICML
2005
IEEE
15 years 10 months ago
Generalized skewing for functions with continuous and nominal attributes
This paper extends previous work on skewing, an approach to problematic functions in decision tree induction. The previous algorithms were applicable only to functions of binary v...
Soumya Ray, David Page
ISBI
2006
IEEE
15 years 10 months ago
Incremental learning for segmentation in medical images
Hand-coded vision systems are problematic in complex medical domains and are hard to change as new information emerges. Knowledge-Engineering and Machine Learning approaches to in...
Avishkar Misra, Arcot Sowmya, Paul Compton
CIKM
2004
Springer
15 years 3 months ago
Processing search queries in a distributed environment
Endeca’s approach to processing search queries in a distributed computing environment is predicated on concerns of correctness, scalability, and flexibility in deployment. Using...
Frederick Knabe, Daniel Tunkelang