5473 search results - page 633 / 1095 » On the graph isomorphism problem |
182
click to vote
FOSSACS
2012
Springer
14 years 2 months ago
2012
Springer
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...
210
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
177
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
191
click to vote
PAMI
2010
15 years 5 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
186
click to vote
CVPR
2003
IEEE
16 years 9 months ago
2003
IEEE
Probabilistic models have been adopted for many computer vision applications, however inference in highdimensional spaces remains problematic. As the statespace of a model grows, ...