Sciweavers

1933 search results - page 53 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
11 years 11 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
PPSN
2004
Springer
14 years 2 months ago
An Improved Evaluation Function for the Bandwidth Minimization Problem
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our Î...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
IJCAI
2003
13 years 10 months ago
An Improved Algorithm for Optimal Bin Packing
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
Richard E. Korf
JSAC
2006
100views more  JSAC 2006»
13 years 8 months ago
An improved algorithm for optimal lightpath establishment on a tree topology
Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelength-division multiplexed (WDM) optical network so as to achieve greater capacit...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
ERCIMDL
2007
Springer
87views Education» more  ERCIMDL 2007»
14 years 2 months ago
Thesaurus-Based Feedback to Support Mixed Search and Browsing Environments
We propose and evaluate a query expansion mechanism that supports searching and browsing in collections of annotated documents. Based on generative language models, our feedback me...
Edgar Meij, Maarten de Rijke