3946 search results - page 157 / 790 » The computational complexity of choice sets |
178
click to vote
GI
2007
Springer
16 years 22 days ago
2007
Springer
: State-of-the-art interoperability between heterogeneous systems on a technical level builds on services oriented architectures (SOA) for a given problem space. Semantics can be i...
193
click to vote
WDAG
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
225
click to vote
CVIU
2007
15 years 6 months ago
2007
This paper addresses the problem of object detection and recognition in complex scenes, where objects are partially occluded. The approach presented herein is based on the hypothe...
220
click to vote
BTW
1993
Springer
15 years 10 months ago
1993
Springer
It is clearly crucial for the success of object-oriented databases to find effiĆ cient implementations that improve on the performance of relational sysĆ tems, rather than being...
194
click to vote
WAOA
2005
Springer
16 years 1 days ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...