Sciweavers

889 search results - page 151 / 178
» A Method for Secure Query Processing in Mobile Databases
Sort
View
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 1 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
ICRA
2010
IEEE
153views Robotics» more  ICRA 2010»
14 years 8 months ago
High-speed 3D object recognition using additive features in a linear subspace
— In this paper we propose a method of high-speed 3D object recognition using linear subspace method and our 3D features. This method can be applied to partial models with any si...
Asako Kanezaki, Hideki Nakayama, Tatsuya Harada, Y...
PODS
2006
ACM
137views Database» more  PODS 2006»
15 years 9 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
BMCBI
2010
205views more  BMCBI 2010»
14 years 9 months ago
A fast indexing approach for protein structure comparison
Background: Protein structure comparison is a fundamental task in structural biology. While the number of known protein structures has grown rapidly over the last decade, searchin...
Lei Zhang, James Bailey, Arun Siddharth Konagurthu...
EDBT
2010
ACM
185views Database» more  EDBT 2010»
15 years 4 months ago
Optimizing joins in a map-reduce environment
Implementations of map-reduce are being used to perform many operations on very large data. We examine strategies for joining several relations in the map-reduce environment. Our ...
Foto N. Afrati, Jeffrey D. Ullman