14386 search results - page 363 / 2878 » The Chinese Generals Problem |
191
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
195
click to vote
ICALP
2007
Springer
16 years 29 days ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
178
click to vote
FCT
2005
Springer
16 years 10 days ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
198
click to vote
TAMC
2010
Springer
15 years 12 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
206
click to vote
ICDT
2010
ACM
15 years 11 months ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...