Sciweavers

4106 search results - page 736 / 822
» A Computational Model for Metric Spaces
Sort
View
LCPC
2009
Springer
15 years 2 months ago
Using the Meeting Graph Framework to Minimise Kernel Loop Unrolling for Scheduled Loops
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
Mounira Bachir, David Gregg, Sid Ahmed Ali Touati
COMPGEOM
2010
ACM
15 years 1 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
EDBT
2009
ACM
145views Database» more  EDBT 2009»
15 years 1 months ago
An efficient online auditing approach to limit private data disclosure
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...
Haibing Lu, Yingjiu Li, Vijayalakshmi Atluri, Jaid...
ICCV
1995
IEEE
15 years 1 months ago
Recognizing 3D Objects Using Photometric Invariant
In this paper we describe a new e cient algorithm for recognizing 3D objects by combining photometric and geometric invariants. Some photometric properties are derived, that are i...
Kenji Nagao
BIRTHDAY
2010
Springer
14 years 11 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe