Sciweavers

108 search results - page 4 / 22
» Approximation Via Value Unification
Sort
View
AMC
2005
112views more  AMC 2005»
14 years 9 months ago
Stieltjes moment problem via fractional moments
Stieltjes moment problem is considered to recover a probability density function from the knowledge of its infinite sequence of ordinary moments. The approximate density is obtain...
Pierluigi Novi Inverardi, Alberto Petri, Giorgio P...
AAAI
2011
13 years 9 months ago
On Expressing Value Externalities in Position Auctions
Externalities are recognized to exist in the sponsored search market, where two co-located ads compete for user attention. Existing work focuses on the effect of another ad on th...
Florin Constantin, Malvika Rao, Chien-Chung Huang,...
ML
2008
ACM
248views Machine Learning» more  ML 2008»
14 years 9 months ago
Feature selection via sensitivity analysis of SVM probabilistic outputs
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
Kai Quan Shen, Chong Jin Ong, Xiao Ping Li, Einar ...
CIKM
2004
Springer
15 years 3 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel
SODA
2003
ACM
158views Algorithms» more  SODA 2003»
14 years 11 months ago
Faster approximation algorithms for the minimum latency problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, David P. Williamson