2754 search results - page 79 / 551 » Distributed Weighted Matching |
157
click to vote
CONCUR
2009
Springer
16 years 22 days ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
161
click to vote
ICALP
2009
Springer
16 years 29 days ago
2009
Springer
We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly inv...
139
click to vote
SPAA
2006
ACM
16 years 3 days ago
2006
ACM
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
149
click to vote
SCALESPACE
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. In this paper, we propose an orientation-matching minimization for denoising digital images with an additive noise. Inspired by the two-step algorithm in the TV-Stokes de...
157
click to vote
MIDDLEWARE
2005
Springer
15 years 11 months ago
2005
Springer
The content-based publish/subscribe model has been adopted by many services to deliver data between distributed users based on application-specific semantics. Two key issues in su...