Sciweavers

518 search results - page 80 / 104
» Beating a Random Assignment
Sort
View
NIPS
2001
15 years 3 months ago
The Intelligent surfer: Probabilistic Combination of Link and Content Information in PageRank
The PageRank algorithm, used in the Google search engine, greatly improves the results of Web search by taking into account the link structure of the Web. PageRank assigns to a pa...
Matthew Richardson, Pedro Domingos
UAI
1996
15 years 3 months ago
Why is diagnosis using belief networks insensitive to imprecision in probabilities?
Recent research has found that diagnostic performance with Bayesian belief networks is often surprisingly insensitive to imprecision in the numerical probabilities. For example, t...
Max Henrion, Malcolm Pradhan, Brendan Del Favero, ...
ANOR
2007
80views more  ANOR 2007»
15 years 2 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
CACM
2010
104views more  CACM 2010»
15 years 2 months ago
Faster dimension reduction
Data represented geometrically in high-dimensional vector spaces can be found in many applications. Images and videos, are often represented by assigning a dimension for every pix...
Nir Ailon, Bernard Chazelle
ANOR
2006
133views more  ANOR 2006»
15 years 2 months ago
An integrated model for logistics network design
In this paper we introduce a new formulation of the logistics network design problem encountered in deterministic, single-country, single-period contexts. Our formulation is flexi...
Jean-François Cordeau, Federico Pasin, Mari...