1647 search results - page 125 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
161
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
131
click to vote
TSP
2010
14 years 11 months ago
2010
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
262
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
115
click to vote
WINE
2009
Springer
15 years 11 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
171
click to vote
ICIAP
2007
ACM
15 years 6 months ago
2007
ACM
The paper deals with the design and implementation of a stereo algorithm. Disparity map is formulated as a Markov Random Field with a new smoothness constraint depending not only ...