Sciweavers

3422 search results - page 455 / 685
» Random Subset Optimization
Sort
View
150
Voted
ICALP
2011
Springer
14 years 7 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
177
Voted
CRV
2011
IEEE
278views Robotics» more  CRV 2011»
14 years 3 months ago
Online Visual Vocabularies
Abstract—The idea of an online visual vocabulary is proposed. In contrast to the accepted strategy of generating vocabularies offline, using the k-means clustering over all the ...
Yogesh A. Girdhar, Gregory Dudek
135
Voted
ECCV
2006
Springer
16 years 5 months ago
Balanced Exploration and Exploitation Model Search for Efficient Epipolar Geometry Estimation
Abstract. The estimation of the epipolar geometry is especially difficult where the putative correspondences include a low percentage of inlier correspondences and/or a large subse...
Liran Goshen, Ilan Shimshoni
156
Voted
WWW
2008
ACM
16 years 4 months ago
Trust-based recommendation systems: an axiomatic approach
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
166
Voted
KDD
2008
ACM
264views Data Mining» more  KDD 2008»
16 years 4 months ago
Stable feature selection via dense feature groups
Many feature selection algorithms have been proposed in the past focusing on improving classification accuracy. In this work, we point out the importance of stable feature selecti...
Lei Yu, Chris H. Q. Ding, Steven Loscalzo