Sciweavers

1839 search results - page 192 / 368
» Feature Selection in Clustering Problems
Sort
View
JMLR
2012
13 years 21 days ago
On Bisubmodular Maximization
Bisubmodularity extends the concept of submodularity to set functions with two arguments. We show how bisubmodular maximization leads to richer value-of-information problems, usin...
Ajit Singh, Andrew Guillory, Jeff Bilmes
71
Voted
ICPR
2004
IEEE
15 years 11 months ago
An Efficient Automatic Redeye Detection and Correction Algorithm
A fully automatic redeye detection and correction algorithm is presented to address the redeye artifacts in digital photos. The algorithm contains a redeye detection part and a co...
Dan Tretter, Huitao Luo, Jonathan Yen
107
Voted
OPODIS
2004
14 years 11 months ago
Self-optimizing DHTs Using Request Profiling
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
Alina Bejan, Sukumar Ghosh
SIGIR
2009
ACM
15 years 4 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
81
Voted
CP
2003
Springer
15 years 3 months ago
CP-IP Techniques for the Bid Evaluation in Combinatorial Auctions
Abstract. Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items...
Alessio Guerri, Michela Milano