1041 search results - page 44 / 209 » Randomizing Reductions of Search Problems |
SSIAI
2002
IEEE
14 years 20 days ago
2002
IEEE
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
IPPS
2000
IEEE
14 years 4 days ago
2000
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...
FOCS
1998
IEEE
14 years 20 hour ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
DASFAA
2010
IEEE
14 years 2 days ago
2010
IEEE
xml keyword search provides a simple and user-friendly way of retrieving data from xml databases, but the ambiguities of keywords make it difficult to effectively answer keyword qu...
JAIR
2007
13 years 7 months ago
2007
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins...