Sciweavers

654 search results - page 62 / 131
» Complexity of Answering Queries Using Materialized Views
Sort
View
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
16 years 19 days ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
141
Voted
HAPTICS
2007
IEEE
15 years 9 months ago
Accelerated Proximity Queries for Haptic Rendering of Deformable Models
We present a fast proximity query algorithm for haptic display of complex deformable models using a layered representation. Assuming that each solid model can be represented as a ...
Nico Galoppo, Miguel A. Otaduy, Paul Mecklenburg, ...
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
16 years 3 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
CAISE
2005
Springer
15 years 8 months ago
Query Processing Using Ontologies
Abstract. Recently, the database and AI research communities have paid increased attention to ontologies. The main motivating reason is that ontologies promise solutions for comple...
Chokri Ben Necib, Johann Christoph Freytag
ADBIS
1998
Springer
97views Database» more  ADBIS 1998»
15 years 7 months ago
Using Queries with Multi-Directional Functions for Numerical Database Applications
Object-oriented database management systems are often motivated by their support for new emerging application areas such as computer-aided design and analysis systems. The object-o...
Staffan Flodin, Kjell Orsborn, Tore Risch