Sciweavers

14161 search results - page 260 / 2833
» On generalized middle-level problem
Sort
View
CPAIOR
2008
Springer
15 years 8 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
FOCS
2006
IEEE
16 years 18 days ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák
FOSSACS
2009
Springer
16 years 1 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
MM
2006
ACM
175views Multimedia» more  MM 2006»
16 years 15 days ago
The challenge problem for automated detection of 101 semantic concepts in multimedia
We introduce the challenge problem for generic video indexing to gain insight in intermediate steps that affect performance of multimedia analysis methods, while at the same time...
Cees Snoek, Marcel Worring, Jan van Gemert, Jan-Ma...
COLT
2001
Springer
15 years 11 months ago
Ultraconservative Online Algorithms for Multiclass Problems
In this paper we study a paradigm to generalize online classification algorithms for binary classification problems to multiclass problems. The particular hypotheses we investig...
Koby Crammer, Yoram Singer