2827 search results - page 70 / 566 » Robustness of PSPACE-complete sets |
ICSM
2006
IEEE
14 years 4 months ago
2006
IEEE
Software Engineers frequently need to locate and understand the code that implements a specific user feature of a large system. This paper reports on a study by Motorola Inc. and ...
COCO
2004
Springer
14 years 3 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
MICRO
2010
IEEE
13 years 8 months ago
2010
IEEE
Efficient management of last level caches (LLCs) plays an important role in bridging the performance gap between processor cores and main memory. This paper is motivated by two key...
TWC
2008
13 years 10 months ago
2008
The distance between nodes in a wireless sensor network (WSN) is an important factor in the performance that can be extracted from the network for many tasks. However, the distanc...
ICIP
2003
IEEE
14 years 11 months ago
2003
IEEE
Robust registration of two 3-D point sets is a common problem in computer vision. The Iterative Closest Point (ICP) algorithm is undoubtedly the most popular algorithm for solving...