Sciweavers

4110 search results - page 411 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
TCS
2008
15 years 6 months ago
Scheduling to maximize participation
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...
CONSTRAINTS
2002
107views more  CONSTRAINTS 2002»
15 years 6 months ago
Fourier Elimination for Compiling Constraint Hierarchies
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring tha...
Warwick Harvey, Peter J. Stuckey, Alan Borning
ESWA
2002
89views more  ESWA 2002»
15 years 6 months ago
A parallelized indexing method for large-scale case-based reasoning
Case-based reasoning (CBR) is a commonly seen problem-solving methodology in artificial intelligence. It can correctly take advantage of the situations and methods in former cases...
Wei-Chou Chen, Shian-Shyong Tseng, Lu-Ping Chang, ...
CVPR
2010
IEEE
14 years 4 months ago
Abrupt motion tracking via adaptive stochastic approximation Monte Carlo sampling
Robust tracking of abrupt motion is a challenging task in computer vision due to the large motion uncertainty. In this paper, we propose a stochastic approximation Monte Carlo (...
Xiuzhuang Zhou and Yao Lu
207
Voted
ML
2002
ACM
167views Machine Learning» more  ML 2002»
15 years 6 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...