1662 search results - page 274 / 333 » The Computational Complexity of Agent Design Problems |
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
EGC
2005
Springer
14 years 2 months ago
2005
Springer
We are concerned with the following problem: How do we allow a community of users to access and process diverse data stored in many different formats? Standard data formats and da...
ICPADS
2002
IEEE
14 years 1 months ago
2002
IEEE
Efficient determination of processing termination at barrier synchronization points can occupy an important role in the overall throughput of parallel and distributed computing sy...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
Recovering 3D geometry from a single 2D line drawing is an important and challenging problem in computer vision. It has wide applications in interactive 3D modeling from images, c...
SI3D
2005
ACM
14 years 2 months ago
2005
ACM
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...