Sciweavers

2100 search results - page 202 / 420
» Fundamentals of the problem
Sort
View
81
Voted
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
16 years 1 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
111
Voted
ICALP
2009
Springer
16 years 1 months ago
Functional Monitoring without Monotonicity
The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi [CMY08] to initiate a formal study of the communication cost of certain fu...
Chrisil Arackaparambil, Joshua Brody, Amit Chakrab...
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
16 years 2 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
106
Voted
AAAI
2004
15 years 2 months ago
Complete Local Search for Propositional Satisfiability
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
Hai Fang, Wheeler Ruml
DISOPT
2008
138views more  DISOPT 2008»
15 years 25 days ago
An algorithmic framework for convex mixed integer nonlinear programs
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, ...