2983 search results - page 261 / 597 » The group marriage problem |
158
click to vote
IAT
2007
IEEE
16 years 1 months ago
2007
IEEE
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
189
click to vote
CCIA
2007
Springer
16 years 29 days ago
2007
Springer
Polysemy is one of the most difficult problems when dealing with natural language resources. Consequently, automated ontology learning from textual sources (such as web resources) ...
188
click to vote
EMMCVPR
2007
Springer
16 years 29 days ago
2007
Springer
Video segmentation requires the partitioning of a series of images into groups that are both spatially coherent and smooth along the time axis. We formulate segmentation as a Bayes...
193
click to vote
FCT
2007
Springer
16 years 29 days ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
138
click to vote
ISSAC
2007
Springer
16 years 28 days ago
2007
Springer
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations of opera...