Sciweavers

1456 search results - page 137 / 292
» Improved Randomized Results for That Interval Selection Prob...
Sort
View
123
Voted
CIVR
2008
Springer
279views Image Analysis» more  CIVR 2008»
15 years 27 days ago
Semi-supervised learning of object categories from paired local features
This paper presents a semi-supervised learning (SSL) approach to find similarities of images using statistics of local matches. SSL algorithms are well known for leveraging a larg...
Wen Wu, Jie Yang
CIKM
2009
Springer
15 years 5 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
PPSN
2010
Springer
14 years 9 months ago
Ant Colony Optimization with Immigrants Schemes in Dynamic Environments
Abstract. In recent years, there has been a growing interest in addressing dynamic optimization problems (DOPs) using evolutionary algorithms (EAs). Several approaches have been de...
Michalis Mavrovouniotis, Shengxiang Yang
CORR
2012
Springer
183views Education» more  CORR 2012»
13 years 6 months ago
Learning Determinantal Point Processes
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
Alex Kulesza, Ben Taskar
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
15 years 8 months ago
Amplified Hardness of Approximation for VCG-Based Mechanisms
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
Shaddin Dughmi, Hu Fu, Robert Kleinberg