Sciweavers

3758 search results - page 31 / 752
» A Complete Subsumption Algorithm
Sort
View
OA
1989
237views Algorithms» more  OA 1989»
13 years 11 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
JDCTA
2010
188views more  JDCTA 2010»
13 years 2 months ago
Compressive Sensing Signal Detection Algorithm Based on Location Information of Sparse Coefficients
Without reconstructing the signal themselves, signal detection could be solved by detection algorithm, which directly processes sampling value obtained from compressive sensing si...
Bing Liu, Ping Fu, Shengwei Meng, Lunping Guo
CACM
2008
65views more  CACM 2008»
13 years 6 months ago
Scene completion using millions of photographs
What can you do with a million images? In this paper we present a new image completion algorithm powered by a huge database of photographs gathered from the Web. The algorithm pat...
James Hays, Alexei A. Efros
IROS
2007
IEEE
131views Robotics» more  IROS 2007»
14 years 1 months ago
A hybrid approach for complete motion planning
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
Liangjun Zhang, Young J. Kim, Dinesh Manocha
AAAI
2004
13 years 9 months ago
Complete Local Search for Propositional Satisfiability
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
Hai Fang, Wheeler Ruml