Sciweavers

867 search results - page 133 / 174
» The Generalized Maximum Coverage Problem
Sort
View
145
Voted
NIPS
2007
15 years 6 months ago
An Analysis of Convex Relaxations for MAP Estimation
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
Pawan Mudigonda, Vladimir Kolmogorov, Philip H. S....
298
Voted
ICDE
1995
IEEE
192views Database» more  ICDE 1995»
16 years 6 months ago
Mining Sequential Patterns
Abstract. The problem of mining sequential patterns was recently introduced in 3 . We are given a database of sequences, where each sequence is a list of transactions ordered by tr...
Rakesh Agrawal, Ramakrishnan Srikant
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
16 years 5 months ago
Multiple intents re-ranking
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin
137
Voted
CPAIOR
2005
Springer
15 years 10 months ago
Constraint Programming Based Column Generation for Employee Timetabling
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
EVOW
2012
Springer
14 years 23 days ago
HyFlex: A Benchmark Framework for Cross-Domain Heuristic Search
This paper presents HyFlex, a software framework for the development of cross-domain search methodologies. The framework features a common software interface for dealing with diff...
Gabriela Ochoa, Matthew R. Hyde, Timothy Curtois, ...