Sciweavers

38 search results - page 5 / 8
» Randomized Competitive Analysis for Two-Server Problems
Sort
View
145
Voted
ML
2008
ACM
248views Machine Learning» more  ML 2008»
15 years 23 days 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 ...
91
Voted
JDA
2006
77views more  JDA 2006»
15 years 23 days ago
On Multi-threaded Metrical Task Systems
Traditionally, on-line problems have been studied under the assumption that there is a unique sequence of requests that must be served. This approach is common to most general mod...
Esteban Feuerstein, Steven S. Seiden, Alejandro St...
111
Voted
ACCV
2006
Springer
15 years 6 months ago
Probabilistic Modeling for Structural Change Inference
We view the task of change detection as a problem of object recognition from learning. The object is defined in a 3D space where the time is the 3rd dimension. We propose two com...
Wei Liu, Véronique Prinet
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
16 years 1 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
CVPR
2012
IEEE
13 years 3 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr