1368 search results - page 52 / 274 » Avoiding Simplicity Is Complex |
DCG
2006
13 years 10 months ago
2006
In a 1967 paper, Banchoff stated that a certain type of polyhedral curvature, that applies to all finite polyhedra, was zero at all vertices of an odd-dimensional polyhedral manifo...
TOPLAS
2002
13 years 9 months ago
2002
A number of existing compiler techniques hinge on the analysis of array accesses in the program. The most important task in array access analysis is to collect the information abo...
IROS
2008
IEEE
14 years 4 months ago
2008
IEEE
— This paper presents a new method for reactive collision avoidance for mobile robots in complex and cluttered environments. Our technique is to adapt the “divide and conquerâ€...
FSTTCS
2008
Springer
13 years 11 months ago
2008
Springer
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
ICIP
2001
IEEE
14 years 11 months ago
2001
IEEE
One of the main goals in Content Based Image Retrieval (CBIR) is to incorporate shape into the process in a reliable manner. In order to overcome the difficulties of directly obta...